Find the number of leaves in the binary tree with root A. List the nodes of this

Question

Find the number of leaves in the binary tree with root A. List the nodes of this binary tree in an inorder sequence List the nodes of this binary tree in a postorder sequence. Suppose that you are given two sequences of elements corresponding to the inorder sequence and the preorder sequence. Prove that it is possible to reconstruct a unique binary tree. Given the nodes of a binary tree in the preorder sequence and the postorder sequence, show that it may not be possible to reconstruct a unique binary tree.

Explanation / Answer

The leaves are K,L,M,J,G. Hence total 5

Inorder sequence is:H K D B L I M E A F J C G

pOST ORDER ESQUENCE: K H D L M I E B J F G C A

Yes it is possible to construct a unique binary tree.the last node in the post order is the root.whereas the node is somewhere in the middle in inoreder. Hence the left of that node is left tree whereas the right of that node is the right part of the tree. So on we can proceed and hence we get a unique bianry tree.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.