In a binary search tree implementation of the ADT table,the item with the highest priority value is always in the ______.
A)root of the tree
B)leftmost node of the tree
C)rightmost node of the tree
D)leftmost node at level 1 of the tree

Question

Quizplus · Accepted Answer

In a binary search tree, the rightmost node will always have the highest priority value as all the larger elements are stored on the right side of the root node. Therefore, the correct choice is C - rightmost node of the tree.

In a Binary Search Tree Implementation of the ADT Table,the