Question 3 Priority Queue Implemented Using Binary Search Tree Bottom Heap Root Node O Tru Q37162348

QUESTION 3 In a priority queue implemented using a binary search tree, the bottom of the heap is the root node. O True O False Show transcribed image text QUESTION 3 In a priority queue implemented using a binary search tree, the bottom of the heap is the root node. O True O False

Answer

False

top of the heap (position 1) is the root node. not thebottom of the heap.