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

**2. What is the fundamental operation performed in skew heaps?**

a) intersection

b) difference

c) merging

d) sorting

**Answer: **merging

**3. What is the time per operation of merging, insertion and deletion operations in a skew heap?**

a) O(N)

b) O(log N)

c) O(N log N)

d) O(N2)

**Answer: **O(log N)

**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

**5. Which of the following is difficult to determine the right path length?**

a) Skew heaps

b) Binomial tree

c) Leftist heap

d) d-heap

**Answer: **Skew heaps

**6. The worst case analysis for a naïve merge is given as?**

a) O(N)

b) O( log N)

c) O( N log N)

d) O(N2)

**Answer: **O(N)

**7. How many types of the merge are available in skew heaps?**

a) 1

b) 2

c) 3

d) 4

**Answer: **2

**8. Naïve merge cannot be done in a skew merge.**

a) true

b) false

**Answer: **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)

**10. The worst case running time of all operations in a skew heap is given as?**

a) O(N)

b) O(N log N)

c) O(N2)

d) O(M log N)

**Answer: **O(N)