Binary Search Tree
1. If you are given only the inorder traversal of a binary tree, you can construct the tree uniquely from it.
2. Which of the following sets uniquely determine a binary tree
3. Simulate the insertion of the following numbers in your binary search tree in order. Compute the resulting height of the tree: [1, 2, 3, 4, 5, 6, 7, 8]
4. Simulate the insertion of the following numbers in your binary search tree in order. Compute the resulting height of the tree: [4, 2, 6, 3, 1, 5, 8, 7]
5. Simulate the insertion of the following numbers in your binary search tree in order. Compute the resulting height of the tree: [4, 2, 6, 3, 1, 5, 7, 8]