Binary Search Tree

1. The following values are inserted into the binary search tree in order. Print the inorder traversal of the resulting tree: [6, 3, 9, 1, 10, 8, 7, 2, 5, 4]
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

2. Which of the following statements about uniquely determining a binary search tree is correct?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

3. Which of the following is the resultant tree given the following sequence of insertions:
5, 10, 4, 1, 3, 8, 6

Explanation

Explanation

Explanation

Explanation