ON EXISTENCE OF TREE

As input sequences are the preorder, inorder and postorder of a binary tree, we give the discussion about creating the tree to all conditions. For m-times tree, as input sequences are the preorder and postorder of a tree, we do so. The proofs about the conclusions are structural. DEY WORDS binary-tree; order; existence; algorithm