If I go by the upper bound of 2 * log (n+1), it comes out to be 7. But I am not sure if that is achievable or not. So how can one determine the max possible in this case?

  • 1
    $\begingroup$ What work have you done to try to solve this on your own? What's the tallest red-black tree you've been able to find so far? What's the motivation or context in which you encountered this? $\endgroup$
    – D.W.
    Dec 16, 2021 at 4:58


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.