What is the height of a given minimum ternary heap?
The question is from Ternary Heap in portion Heap of Data Structures & Algorithms I
I have been asked this question in a national level competition.
Right option is (a) 1
Explanation: Minimum ternary heap has the smallest element as its root node. The parent node is all either equal or less than children node in a minimum ternary heap. Height is the total length from the root node to the leaf node. So the height of the minimum ternary heap is 1.