notes different order path in figure areinorder postorderabc*+de*given an order of traversal of tree it is possible to construct tree exampleconsider the following orderinorder dbeac we can construct the binary trees shown below in figure using this order of traversala binary trees constructed using given inorder therefore we conclude that given only one order of traversal of tree it is possible to construct number of binary treesa unique binary tree is not possible to be constructed for construction of unique binary tree we require two orders in which one has to be inorderthe other can be preorder or postorder exampleconsider the following orderslnorder dbeac postorder debca we can construct unique binary tree shown in figure using these orders of traversal lovely professional university