ISRO | ISRO CS 2008 | Question 73
A complete binary tree with the property that the value at each node is as least as large as the values at its children is known as
(A) binary search tree
(B) AVL tree
(C) completely balanced tree
Explanation: In a Max. Binary Heap, the key value at each node is as least as large as the values at its children. Similarly in Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap.
So, correct option is (D).
Quiz of this Question
My Personal Notes arrow_drop_up
Please Login to comment...