head=new node; //head node to list,T is root to the tree
join=head; //global variable
inorder(T)
{
if(T==0)
return;
inorder(t->l);
join->l=T;
join=join->l;
inorder(T->r);
}
head=head->l;
end;
On Aug 26, 10:57 pm, Rahul <[email protected]> wrote:
> how to rearrange the pointers ??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
