Which statement correctly explains Binary search tree?
- A. A binary tree in which each node's left subtree contains smaller values and right subtree contains larger values. ✓
- B. A tree-like data structure used to efficiently store and retrieve strings, especially for prefix matching.
- C. A tree-based structure that satisfies the heap property, often used to implement priority queues.
- D. A linear data structure that follows the First-In-First-Out (FIFO) principle.
Correct answer
A. A binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.
Explanation
Binary search tree refers to a binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.