rama.sit07

 Profile Answers by rama.sit07 

• Nov 1st, 2008

 

Suppose you are given doubly linked list with starting adress as p, then program for converting doubly linked list into singly list is (this is not a program just an algorithm)
 node structure is defined as
   class node
   {
       int info;
       node lptr,rptr;
    }
  main()
{
    node p,q,r;
    q=r=p;
    while(p!=null)
    {
          q=q.rptr;
          q.lptr=null;
     }
 }
now p points to  the first node and behaves like a singly linked list
 
    

piyushbeli

 Profile Answers by piyushbeli 

• Apr 13th, 2009

 

Say

node

{

info

node lptr,rptr

}

main

{

node p;

p=start;

q=p->rptr;

while(p!=Null)

{

q->lptr=Null;

p=q;

q=p->rptr;

}

}