CHAPTER 3 - BINARY SEARCH TREE

1. 1. Which of the following statements is NOT a property of a binary search tree (BST)?

• A. Each node has at most two children.

• B. The values of all nodes in the left subtree of a node are less than the value of the node.

• C. The values of all nodes in the right subtree of a node are greater than the value of the node.

• D. BSTs are efficient for search, insertion, and deletion operations.

2. 2. What is the base case of the binary search tree insertion algorithm?

• A. When the tree is empty.

• B. When the new value is less than the current node's value.

• C. When the new value is greater than the current node's value.

• D. None of the above.

3. 3. What is the time complexity of the binary search tree search algorithm in a balanced tree?

• A. O(1)

• B. O(log n)

• C. O(n)

• D. O(n log n)

• E. O(n^2)

4. 4. Which of the following is a real-world application of binary search trees?

• A. Searching for a particular book in a library.

• B. Sorting a list of numbers.

• C. Finding the shortest path between two points on a map.

• D. All of the above.

5. 5. What happens to the tree if the node to be removed is the only node in the tree?

• A. The tree remains the same.

• B. The tree becomes empty.

• C. The tree is split into two subtrees.

• D. The tree becomes a self-balancing binary search tree.

• E. None of the above.

6. 6. What is the base case of the binary search tree algorithm to find the smallest value?

• A. When the tree is empty.

• B. When the current node has a left child.

• C. When the current node has no left child.

• D. When the current node has a right child.

• E. When the current node has no right child.