+1 vote
in Data Structures & Algorithms I by (88.2k points)
Is decrease priority operation performed more quickly in a ternary heap with respect to the binary heap.

(a) True

(b) False

This question is from Ternary heap in chapter Heap of Data Structures & Algorithms I

The question was posed to me in semester exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (a) True

The explanation is: Ternary heap is a type of data structure in the field of computer science. It is a part of the Heap data structure family. Due to the swapping process, the decrease priority operation performs more quickly in a 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.