 |  |  |  |  |  |  |  |
Circular linked list
 |
Hello all,
I have a question:
What are the advantages & disadvantages of the circular linked list compared with:
a. Usual linked list
b. Doubled linked list
Although the implementation of the usual list functions & the circular list functions are similar…when do we have to use it?? or in which situations the circular list is better than the usual list? :rolleyes:
Thank you,
I have a question:
What are the advantages & disadvantages of the circular linked list compared with:
a. Usual linked list
b. Doubled linked list
Although the implementation of the usual list functions & the circular list functions are similar…when do we have to use it?? or in which situations the circular list is better than the usual list? :rolleyes:
Thank you,
sounds like a homework assignment as you can find the answers in any good textbook dealing with the subject.
•
•
•
•
Originally Posted by girlzone
Hello all,
I have a question:
What are the advantages & disadvantages of the circular linked list compared with:
a. Usual linked list
b. Doubled linked list
Although the implementation of the usual list functions & the circular list functions are similar…when do we have to use it?? or in which situations the circular list is better than the usual list? :rolleyes:
Thank you,
Suppose the case of non circular link list. If u r at the last node of the list and u want to move to first u need to go one - one step back till u reach to first. But in circular link list from last to first u need to make only one move.
In single link list u can move only in one direction but in double link list u can move in any direction, i.e. back or forward.
Single list contain refrence to it next node but not for its backward node. But in Double link list it contain refrences for its next node as well as for its backward node.
Single list can be circular and non circular both.
Same with double link list. It can be both circular or non circular.
•
•
•
•
Originally Posted by girlzone
Hello all,
I have a question:
What are the advantages & disadvantages of the circular linked list compared with:
a. Usual linked list
b. Doubled linked list
Although the implementation of the usual list functions & the circular list functions are similar…when do we have to use it?? or in which situations the circular list is better than the usual list? :rolleyes:
Thank you,
circular list has the biggest advantage of time saving ie when we hav e to go from last node to first node. it doesnot go back to all the inbetween nodes again rather it is the next node that is the first node.
thanks
|
Similar Threads
- circular linked list (C)
- Make a program in C of the Josephus problem using Circular Linked list (C)
- c++ circular linked list destructor (C++)
Other Threads in the C Forum
- Previous Thread: Base64 Decoder
- Next Thread: Phonebook program!
| Thread Tools | Search this Thread |
You need to join our community in order to build your list of favorite forums. You can visit the forum index for a listing of all forums.
Related Forum Features
Latest C Posts
- Today's Posts
- Unanswered Threads
#include * adobe ansi api array asterisks binarysearch centimeter changingto char character cm copyimagefile cprogramme creafecopyofanytypeoffileinc createcopyoffile csyntax database directory dynamic execv feet fgets file fork frequency function getlasterror getlogicaldrivestrin givemetehcodez global grade graphics gtkgcurlcompiling gtkwinlinux hacking highest histogram include incrementoperators infiniteloop input interest kernel keyboard kilometer linked linkedlist linux linuxsegmentationfault list locate logical_drives looping loopinsideloop. lowest match matrix meter microsoft mqqueue number odf opendocumentformat owf pattern pdf performance pointer posix probleminc process program programming radix recursion recv repetition research reversing scanf segmentationfault sequential shape single socket socketprograming standard string systemcall threads turboc unix user voidmain() wab whythiscodecausesegmentationfault windows.h windowsapi
