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

Category: QuestionsWhich of the following is difficult to determine the right path length?
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.