A _______ is a complete binary tree in which the value of each node is less than or equal to the value of its parent, with the maximum-value element at the root.

1
Binary search tree
2
Max heap
3
Min heap
4
B Tree

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation