Open In App
Related Articles

ISRO | ISRO CS 2008 | Question 73

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

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

(D)

Heap



Answer: (D)

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
Please comment below if you find anything wrong in the above post

Last Updated : 13 Jun, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads