Identify the correct concept described as: a self-balancing binary search tree where the height difference between subtrees is at most one.
- A. Queue
- B. Binary search tree
- C. AVL tree ✓
- D. Stack
Correct answer
C. AVL tree
Explanation
AVL tree refers to a self-balancing binary search tree where the height difference between subtrees is at most one.