+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the smallest element of the given minimum ternary heap?

(a) 1

(b) 10

(c) 18

(d) 20

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.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...