Non-recursive Algorithm Which Constructs The Binary Tree With Traversal Sequence

There are many methods to construct a binary tree.Provide the node sequences of a inorder traversal and postorder traversal,then a binary tree can be constructed.Recursive algorithm is usually used.A recursive algorithm structure is simple,clear and readable.But a recursive algorithm will cost too much time and space during the process.We should transform the recursive algorithm into a non-recursive algorithm for time and space efficiency.A non-recursive algorithm is given,which inputs the node sequences of a binary tree for inorder traversal and postorder traversal and constructs the binary tree.The algorithm is optimal for the problem with time complexity O(n),where n is the number of the nodes of the tree.