-2
$\begingroup$

As we know, the maximum height of a red black tree is 2* log (n+1). So lets say we have six nodes [1,2,3,4,5,6]. How to insert them to achieve the maximum height ?

$\endgroup$
1
  • 1
    $\begingroup$ Have you tried natural order? $\endgroup$
    – Gassa
    Jul 25 at 21:21

0

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.