Exercises

1. Which of the following is a true about binary trees:
   1. Every binary tree is either complete or full
   2. Every complete binary tree is also a full binary tree
   3. Every full binary tree is also a complete binary tree
   4. No binary tree is both complete and full
   5. None of the above
2. Which of the tree traversal algorithms visit the root node last?

   Consider this binary search tree:

Figure 6.38: Sample binary search tree

3. Suppose we remove the root node 8, and we wish to replace it with any node from the left subtree, then what will be the new root?
4. What will be the inorder, postorder and preorder traversal of the following tree?

Figure 6.39: Example tree

5. How do you find out if two trees are identical?
6. How many leaves are there in the tree mentioned in question number 4?
7. What is the relation between a perfect binary tree’s height and the...