Analysis on Constructing Binary Tree Algorithms

Creating and traversing an binary tree have always been the indispensable contents in data structure.The classical Algorithms of Constructing Binary Tree is usually on the basis of traversing-binary tree.The precondition is given the condition of left or right child of binary tree node,or pre-order traversal sequence and in-order traversal sequence,or in-order traversal sequence and post-order traversal sequence to ascertain the only one binary tree.Through the analysis on the structure characteristics of Binary Tree,three different algorithms on Constructing Binary Tree can be put forward and analyzed.