What is the range of β in finding the length of the longest path in a randomized binary search tree?

(a) (-1, 0)

(b) (1, 0)

(c) (0, 5)

(d) (0, 1)

I’d like to ask this question from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

The question was asked in semester exam.