Non-recursive Algorithm of Restoring a Binary Tree by Preorder Traversal and Postorder Traversal

There has been a conclusion that the preorder traversal sequence and the postorder traversal sequence cannot restore a unique binary tree in the first literature.In the paper it has been pointed out and proved that preorder traversal sequence and the postorder traversal sequence can restore a unique binary tree under certain conditions.That is,the degree of binary tree is zero or two.The viewpoint has been illuminated in this paper.The non-recursive algorithm has been implemented in Visual C++ 6.0.