Tree has an extra pointer next apart from left and right. Objective
is to set next pointer to point to node successor in the tree.
Following the next pointer, we would be able to produce sorted list.
Looking for both a recursive and non-recursive approach.
--Navneet
--
You received this
I think Threaded Binary Tree solves your Problem
see this http://en.wikipedia.org/wiki/Threaded_binary_tree
On Mon, Jul 4, 2011 at 11:34 PM, Navneet Gupta navneetn...@gmail.comwrote:
Tree has an extra pointer next apart from left and right. Objective
is to set next pointer to point to node
Use the concept used in Morris traversal (same as TBT concept)...
On 7/4/11, sunny agrawal sunny816.i...@gmail.com wrote:
I think Threaded Binary Tree solves your Problem
see this http://en.wikipedia.org/wiki/Threaded_binary_tree
On Mon, Jul 4, 2011 at 11:34 PM, Navneet Gupta
http://geeksforgeeks.org/?p=6358
On 7/4/11, Piyush Sinha ecstasy.piy...@gmail.com wrote:
Use the concept used in Morris traversal (same as TBT concept)...
On 7/4/11, sunny agrawal sunny816.i...@gmail.com wrote:
I think Threaded Binary Tree solves your Problem
see this
@Piyush, it is not about the traversal, you actually have to establish
those links such that once they are established, inorder traversal
would be just like traversing a list.
@Sunny - thanks, exactly what i was looking for
On Mon, Jul 4, 2011 at 11:45 PM, Piyush Sinha ecstasy.piy...@gmail.com
I know its not about the traversali just suggested that one can
use the trick used by Morris traversal to locate the next node of the
inorder traversal...
On 7/4/11, Navneet Gupta navneetn...@gmail.com wrote:
@Piyush, it is not about the traversal, you actually have to establish
those links
U only mentioned in ur question that we have to use next pointer to
connect the nodes...while TBT used the left and right pointers
On 7/5/11, Piyush Sinha ecstasy.piy...@gmail.com wrote:
I know its not about the traversali just suggested that one can
use the trick used by Morris traversal
convert BST into DLL
refer stanford tree recursion problem
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Mon, Jul 4, 2011 at 11:34 PM, Navneet Gupta navneetn...@gmail.comwrote:
Tree has an extra pointer next apart from left and right.
Here is the modified version of Morris inorder tree traversal
algorithmhttp://stackoverflow.com/questions/5502916/please-explain-morris-inorder-tree-traversal-without-using-stacks-or-recursion
inordermorrisiterative(Tnode *root) {
Tnode *current = root, *pred = NULL, *succesor = NULL;
