Ternary Heap Quiz Online Practice Test

1. What key property must a ternary heap maintain for proper execution?

Associative

Commutative

Tree structure

Heap property

2. In a ternary heap, should the leaves be distributed from left to right?

True

False

Sometimes

It depends on the heap configuration

3. What is the name of the process used to construct a ternary heap?

Heapify

Hashing

Linking

Merging

4. A ternary heap falls under which category of data structures?

Array

Hash

Priority Queue

Priority Stack

5. Is a priority queue considered an abstract data type?

True

False

Sometimes

Depends on the implementation

6. Which of the following best describes a ternary heap?

An array with three elements

A linked list with three elements

A tree where each node has three children

A heap where all nodes have three children

7. Who is credited with inventing the d-ary heap?

Carl Rick

Alan Turing

Donald Johnson

Euclid

8. What is the time complexity for adding a new item to a ternary heap containing n elements?

O(log n / log 3)

O(n!)

O(n)

O(1)

9. Is the decrease priority operation faster in a ternary heap compared to a binary heap?

True

False

Sometimes

Depends on the implementation

10. What is the time complexity for reducing the priority of a key in a minimum ternary heap with n elements?

O(log n / log 3)

O(n!)

O(n)

O(1)

11. What is the time complexity for removing the root key from a ternary heap with n elements?

O(log n / log 3)

O(3 log n / log 3)

O(n)

O(1)

12. What is the time complexity for boosting the priority of a key in a minimum ternary heap with n elements?

O(log n / log 3)

O(3 log n / log 3)

O(n)

O(1)

13. What is the time complexity for lowering the priority of a key in a maximum ternary heap with n elements?

O(log n / log 3)

O(3 log n / log 3)

O(n)

O(1)

14. What is the time complexity for constructing a ternary heap through element swapping?

O(log n / log 3)

O(n!)

O(n)

O(1)

15. Which of the following uses a minimum ternary heap as part of its solution?

Prim’s Algorithm

Euclid’s Algorithm

Eight Queens Puzzle

Tree Traversal

Test Name:	Ternary Heap Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	15 / 15
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Ternary Heap MCQ Quiz Online Practice Test