A complete binary tree has a property that the value at each node is at least as large as the values at its children nodes. What is this binary tree known as??

Computer Programming MCQ Questions with Solutions

A complete binary tree has a property that the value at each node is at least as large as the values at its children nodes. What is this binary tree known as?

A) Binary Search Tree
B) AVL tree
C) Completely Balance Tree.
D) Heap.

Answer & Description:

D) Heap.
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.

More Articles on this topic