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.