Question

Where in a max heap with over 15 elements can you find the third-largest value? Select all that apply.

a child of the right child of the root, a child of the left child of the root, leaf node, left or right child of the root, root

Answer 1

Ans:- We can find the third largest-value at:

1. a child of the right child of the root
2. a child of the left child of the root
3. left or right child of the root

Explaination:-

A max heap is a type of data structure which is based on complete binary tree. In the max heap, the value of the parent node will be greater than or equal to the value of it's child node. The root node always contains the large element.

1. Since, the root node always contains the large element of heap, it never contains the third largest number.
2. Since, the size of the heap is over 15 element, so, the leaf node never contains the third largest element.
3. Since, the child node is having smaller or equal value in comparison to the parent node, it may be possible that the right child or left child of the root may contains third largest element.
4. If the largest element occurs more than one time, then, it is possible that "a child of the right child of the root" or "a child of the left child of the root" may contains the third largest element, since, the duplicate largest element will be placed on the child of the root(left or right).