What is implicit data structure? And Is heap an implicit data structure to implement priority queue?

Kindly explain in simple words as I am newbie to data structures. Thank you!What is implicit data structure? And Is heap an implicit data structure to implement priority queue?
Yeah if you are a newbie to data structures, I don't think you should start with this. Just googling a little I saw a lot of theoretical crap and formulas but no data structures. A structure in C for instance can contain lots of built-in data types (float, char, int, and pointers to all of those), and user defined data types which are other structure (and classes in c++). Implicit data structures contain only data type and not pointers. I gather they are even condensed further into bit fields to save space. But no compression algorithm is used.



A queue is a way of organizing records as first in first out like a line at a movie theatre. But a priority queue allows "cut ins" or "vip" status. Windows style Operating systems use queues for the messaging system to programs. You program might constantly be getting messages either from user input or other information essential for your program. These messages are queued up for the program to process them.