Beginner
Data Structures & Algorithms
Q5 / 100
What is a binary search tree (BST)?
Correct! Well done.
Incorrect.
The correct answer is B) A tree where left child < parent < right child for every node
B
Correct Answer
A tree where left child < parent < right child for every node
Explanation
In a BST, all values in a node's left subtree are less than the node's value, and all values in the right subtree are greater. This ordering enables O(log n) average search.
Progress
5/100