what is the major differences between queue and circular list as data structures ??
i know tht queue must be LIFO and circular list mustn't be
i need a deep information plz
Actually, a queue is a FIFO structure (you may have been thinking of a stack, which is LIFO).
A queue is like a stack, except FIFO (it uses a push and pop and all that, just like a stack). A circular list, on the other hand, is like a linked list whose last element contains a pointer to the first element (i.e., it loops back upon itself, having no last or first element).
I hope I have all my information correct (sorry, if it's not), and I hope I answered your question (sorry, if I didn't). :-)
To unsubscribe, send a blank message to <mailto:[EMAIL PROTECTED]>.
| Yahoo! Groups Sponsor | |
|
|
Yahoo! Groups Links
- To visit your group on the web, go to:
http://groups.yahoo.com/group/c-prog/
- To unsubscribe from this group, send an email to:
[EMAIL PROTECTED]
- Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.
