Construct Binary Tree from Inorder and Postorder TraversalSep 30 '12
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
You may assume that duplicates do not exist in the tree.
No comments:
Post a Comment