A Binary Tree Stores Items That Have a Natural Order

Multiple Choice

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