Question

Given the following keys:

Keys: 500, 300, 450, 650, 700, 400, 660, 550, 680, 430, 590

1. A) Create a binary search tree.

2. B) Represent the binary search tree in part A in an array.

3. C) Show your tree in Part A after deleting the root.

4. D) Define a binary tree (without duplication, with more than 3 nodes) such that the

   result of the Inorder and Postorder traversal are the same).

Answer 1