Construct a Tree by Inorder and Postorder Traversals
06/07/2011 8:23 AM
please tell me how if following inorder and postorder traversals are given, can we construct the tree? I was unable to construct some contradiction is coming.
POSTORDER : D K E C H Q J I B A
INORDER : D C K E A H B Q J I
__________________
Self-Belief is the key of every hurdle.
Re: Construct a Tree by Inorder and Postorder Traversals
06/07/2011 8:41 AM
At least try a search first. Then you might have some idea what the assignment is about. I got 8,600 hits in .18 seconds by performing a simple search.