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

We have the best collection of Skew Heap (Data Structure) MCQs and answer with FREE PDF. These Skew 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.

## Skew Heap (Data Structure) MCQs

#### 1. The relationship of skew heaps to leftist heaps is analogous to that of?

a) Splay tree and AVL tree

b) Red black tree and AVL tree

c) Binary tree and Splay tree

d) Binary tree and Red black tree

Answer: Splay tree and AVL tree

a) intersection

b) difference

c) merging

d) sorting

a) O(N)

b) O(log N)

c) O(N log N)

d) O(N2)

#### 4. Why would a recursive implementation fail in skew heaps?

a) skew heaps are self adjusting

b) efficiency gets reduced

c) lack of stack space

d) time complexity

Answer: lack of stack space

a) Skew heaps

b) Binomial tree

c) Leftist heap

d) d-heap

a) O(N)

b) O( log N)

c) O( N log N)

d) O(N2)

a) 1

b) 2

c) 3

d) 4

a) true

b) false

#### 9. What is the amortized efficiency of skew merge?

a) O(N)

b) O( log N)

c) O( N log N)

d) O(N2)

Answer: O( log N)

a) O(N)

b) O(N log N)

c) O(N2)

d) O(M log N)