in given binary tree (there are 2 pointers which point left and right node), change it to [b]sorted [/b]double linked list , by manipulating pointers, not remaking new list.
for instance, binary tree->left can represent double linked list->previous, tree->right represents list->next.
correction to the problem
the tree is an sorted binary tree.
The Original problem and solutions to this problem are at
http://cslibrary.stanford.edu/109/TreeListRecursion.html
Udaya Bhaskar Rao
binary tree to double linked list
yes. list manipulated pointers from binery tree has to be sorted.
binary tree to double linked list
I didn't quite get the question. How do you decide the order of elements in the list?