Question
Which data structure or concept is best described as a self-balancing binary search tree with tightly controlled subtree heights?
Select an option. Your answer will be checked instantly.
Correct Answer: A. AVL Tree
Explanation:
AVL Tree is a self-balancing binary search tree with tightly controlled subtree heights.
This description distinguishes it from the other choices.
Leave a Reply