What is the child of smallest element of the given minimum ternary heap?
My query is from Ternary Heap in section Heap of Data Structures & Algorithms I
I had been asked this question in an online interview.
The correct choice is (b) 10
For 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. In the above minimum ternary heap, the smallest element is 1 and its children are 10, 18, 20.