# 50+ Ternary Heap (Data Structure) MCQs with FREE PDF

We have the best collection of Ternary Heap (Data Structure) MCQs and answer with FREE PDF. These Ternary Heap (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

a) Associative

b) Commutative

c) Tree

d) Heap

a) Heapify

b) Hashing

d) Merging

#### 3. Which type of data structure is a ternary heap?

a) Array

b) Hash

c) Priority Queue

d) Priority Stack

#### 4. What is a ternary heap?

a) An array with three elements

b) Linked list with three elements

c) Tree with three children

d) Heap with all nodes having three children

Answer: Heap with all nodes having three children

#### 5. Who invented d-ary heap?

a) Carl Rick

b) Alan Turing

c) Donald Johnson

d) Euclid

#### 6. What is the time complexity for inserting a new item in a ternary heap of n elements?

a) O (log n/ log 3)

b) O (n!)

c) O (n)

d) O (1)

Answer: O (log n/ log 3)

#### 7. What is the time complexity for decreasing priority of key in a minimum ternary heap of n elements?

a) O (log n/ log 3)

b) O (n!)

c) O (n)

d) O (1)

Answer: O (log n/ log 3)

#### 8. What is the time complexity for increasing priority of key in a maximum ternary heap of n elements?

a) O (log n/ log 3)

b) O (n!)

c) O (n)

d) O (1)

Answer: O (log n/ log 3)

#### 9. What is the time complexity for deleting root key in a ternary heap of n elements?

a) O (log n/ log 3)

b) O (3log n/ log 3)

c) O (n)

d) O (1)

Answer: O (3log n/ log 3)

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

a) O (log n/ log 3)

b) O (3log n/ log 3)

c) O (n)

d) O (1)

Answer: O (3log n/ log 3)