Is decrease priority operation performed more quickly in a ternary

is-decrease-priority-operation-performed-more-quickly-in-a-ternary

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.

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.