What is the smallest element of the given minimum ternary heap?
The doubt is from Ternary Heap topic in section Heap of Data Structures & Algorithms I
This question was addressed to me during an interview for a job.
Right option is (a) 1
For explanation: Ternary heap is a type of data structure in the field of computer science. It is a part of the Heap data structure family. 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.