+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following is difficult to determine the right path length?

(a) Skew heaps

(b) Binomial tree

(c) Leftist heap

(d) d-heap

I need to ask this question from Heap topic in division Heap of Data Structures & Algorithms I

I got this question in class test.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct option is (a) Skew heaps

The best I can explain: It is an open problem to determine precisely the expected right path length of both leftist and skew heaps and comparatively, the latter is difficult.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.