+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is the implementation of the ternary tree?

(a) AVL Tree

(b) Ternary Heap

(c) Hash Table

(d) Dictionary

Enquiry is from Ternary Tree topic in division Trees of Data Structures & Algorithms I

The question was asked in my homework.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct answer is (b) Ternary Heap

Explanation: Ternary tree is used to implement ternary search tree and ternary heap. While AVL Tree, hash Table, dictionary are different types of Data Structures.

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.