circular linked list
Hai All,
what is the key concept of circular linked list.
My known method is we can do using head value of 1 (first data) 1 - > 2 -> 3 -> 4 ->1 (4 is the last data at this chain) Is it correct to do the circular linked list.
how we have to delete some value in the list.
If i want to delete 3 means what steps we have to do.
Is there a way to simulate the list with out having the assignment
of head.
Regards,
Muthukumar.
Quoted 4 lines · MuthuKumar
Hai All,
what is the key concept of circular linked list.
Quoted 10 lines
My known method is we can do using head value of 1 (first data) 1 - > 2 -> 3 -> 4 ->1 (4 is the last data at this chain) Is it correct to do the circular linked list.
how we have to delete some value in the list.
If i want to delete 3 means what steps we have to do.Is there a way to simulate the list with out having the assignment
of head.
Yes, this is done by passing a pointer to the start pointer. An
implementation can be found here : http://annex.sagehall.com/~abukhzam/cp2/CPII.html
Greets,
Jad
Quoted 11 lines
Quoted 11 lines
what is the key concept of circular linked list.
My known method is we can do using head value of 1 (first data) 1 - > 2 -> 3 -> 4 ->1 (4 is the last data at this chain) Is it correct to do the circular linked list.
how we have to delete some value in the list.
If i want to delete 3 means what steps we have to do.
Quoted 8 lines
Quoted 4 lines
Is there a way to simulate the list with out having the assignment
of head.Yes, this is done by passing a pointer to the start pointer. An
implementation can be found here :
http://annex.sagehall.com/~abukhzam/cp2/CPII.html
Hai Jad.
Thanks for the guideline.
Is there a way to implement a circular linked list without the HEAD assignment. First of all ,is it possible ,If else what is the problem with that.
Regards,
Muthukumar.
Fundamental Rule of LinkList Traversal: You have to start somewhere.
The major function of a head node, is to point at that starting place. doesn't mater if its a single link list; double link list; circular link list; in order to traverse it, you have to get to a node. I cannot think of a better way of doing that then having an established pointer to a known node. It also gives many many useful functions in a circular linked list; for instance if you want to make 1 pass, you start at the head node and then go head->next until current node is head otherwise, you might just circle without a clear termination point/ end case.
Quoted 32 lines · Muthukumar
Quoted 9 lines
Quoted 9 lines
what is the key concept of circular linked list.
My known method is we can do using head value of 1 (first data) 1 - > 2 -> 3 -> 4 ->1 (4 is the last data at this chain) Is it correct to do the circular linked list.
how we have to delete some value in the list.
If i want to delete 3 means what steps we have to do.Quoted 8 lines
Quoted 4 lines
Is there a way to simulate the list with out having the assignment
of head.Yes, this is done by passing a pointer to the start pointer. An
implementation can be found here :
http://annex.sagehall.com/~abukhzam/cp2/CPII.htmlHai Jad.
Thanks for the guideline.
Is there a way to implement a circular linked list without the HEAD assignment. First of all ,is it possible ,If else what is the problem with that.
Regards,
Muthukumar.-
To unsubscribe from this list: send the line "unsubscribe linux-c-programming" in the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html