Try this exercise. Click the correct answer from the options.
Which of the following statements about binary search trees (BSTs) is NOT true?
Click the option that best answers the question.
- A binary search tree is a type of binary tree where the left child of a node is smaller than the node, and the right child is greater.
- Binary search trees allow for efficient search, insert, and delete operations.
- Binary search trees always have a balanced structure.
- The time complexity of searching in a binary search tree is O(log n).