0
$\begingroup$

What would be the insertion algorithm for a modified AVL tree where the balance constraint is 2 instead of 1? Would be the same as a regular AVL tree?

$\endgroup$
1
  • 1
    $\begingroup$ That's a nice exercise for you to work out. $\endgroup$ – Yuval Filmus May 27 '20 at 11:26

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.