Binary Search Tree
1. The following values are inserted into a binary search tree in order. What is the inorder traversal of the resulting tree? [6, 3, 9, 1, 10, 8, 7, 2, 5, 4]
2. Which of the following statements about uniquely determining a binary search tree with distinct keys is correct?
3. Which of the following trees is the result of inserting the keys in the following order into an initially empty binary search tree?
5, 10, 4, 1, 3, 8, 6
5, 10, 4, 1, 3, 8, 6
4. If the keys [7, 4, 9, 2, 5] are inserted into an initially empty BST, which key becomes the right child of 4?
5. What is the height of the BST formed by inserting [10, 5, 15, 3, 7, 12, 18] in that order, where height is measured as the number of edges on the longest root-to-leaf path?
6. Which traversal of the BST produced by any set of distinct keys will list those keys in sorted ascending order?
7. A BST contains the keys 50, 30, 70, 20, 40, 60, and 80. What is the search path for key 65?
8. If a BST becomes completely skewed while containing nodes, what is its height when height is measured as the number of edges?
9. Two BSTs contain exactly the same distinct keys but have different shapes. Which traversal must produce the same sequence for both trees?