From mboxrd@z Thu Jan 1 00:00:00 1970 From: "Muthukumar" Subject: Re: circular linked list Date: Mon, 29 Mar 2004 11:54:16 +0530 Sender: linux-c-programming-owner@vger.kernel.org Message-ID: <00b001c41556$7a20fed0$2e0110ac@mukco> References: <4065E03F.9010306@Saklawi.info> Return-path: List-Id: MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit To: Jad Saklawi Cc: linux-c-programming@vger.kernel.org > > 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. > > > > > 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.