It's not at all important to get it right the first time. It's vitally important to get it right the last time. Andrew Hunt and David Thomas

Construct tree from given inorder/preorder

Language Java | Level Intermediate | Category Data structure | September 8, 2015 8:54 am


Data structure Description

Write a program to traverse binary tree using in order and post order from the binary tree.


Output

   					 

Binary Tree In order Values from array: [7, 10, 4, 3, 1, 2, 8, 11]
Binary Tree Post order Values from array: [4, 10, 3, 1, 7, 11, 8, 2]
Print Values from Binary tree: 7  10  4  3  1  2  8  11  

				    

Comments


No comments available!

Please login to add comments.