I. Points: Draw the Binary Tree obtained after successive insertions of values 1 to 15.
2. (I Points): Draw the Binary Search Tree obtained after successive insertions of values 1 to 15.
3. I Points: Using the tree of Question 2, print the pre-order, in-order, post-order, and level-order paths.
Pre-order:
In-order:
Post-order:
Level-order:
4. Write a function to compute the number of nodes in a BST.
5. Write a function to compute the number of leaves.
6. Write a function to compute the number of internal nodes.
7. Write a function to compute the internal nodes.
8. Write a function to insert a key in a BST.