What is the ancestor of the leaf node in a given minimum ternary heap?
Correct choice is (a) 1
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. Ancestor is the node falling on the path from that node to the root node. So here ancestor of all leaf nodes is 1.