A binary tree stores items that have a natural order in such a way that at each node X,all items stored in the left subtree of X are less than the item stored at X,and all items stored in the right subtree are greater than the item stored at X.Such a binary tree is called
A) an ordered binary tree
B) a binary search tree
C) an AVL tree
D) a priority queue

Question

Quizplus · Accepted Answer

Such a binary tree is called a binary search tree. Option A is incorrect because an ordered binary tree may not necessarily follow the natural order of the items. Option C is incorrect because an AVL tree is a type of self-balancing binary search tree. Option D is incorrect because a priority queue is a data structure where each element has a priority associated with it, and the highest priority element is always at the front of the queue.

A Binary Tree Stores Items That Have a Natural Order