Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree. Analysis This problem can be illustrated by using a simple example. in-order: 4 2 5 (1) 6 7 3 8 post-order: 4 5 2 6 7 8 3 (1) From the post-order array, we know that last element is the root. We can … Read more