Question
Which data structure or concept is best described as a binary tree where left-subtree keys are smaller and right-subtree keys are larger under a chosen ordering?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Binary Search Tree
Explanation:
Binary Search Tree is a binary tree where left-subtree keys are smaller and right-subtree keys are larger under a chosen ordering.
This description distinguishes it from the other choices.
Leave a Reply