c programming program design including data structures 7th edition 1 find the number 5187584
C++ Programming: Program Design Including Data Structures 7th Edition
1. Find the number of leaves in the binary tree with root A.
2. List the nodes of this binary tree in an inorder sequence.
3. List the nodes of this binary tree in a postorder sequence.
4. 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.
5. 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.