I recently learned AVL Trees but I still lack a complete understanding of the concept. I understand that an AVL tree is a Binary search tree that checks for the height of the tree, but I still don't understand how I would apply that to the question. Any help is appreciated!

Rebalance the following AVL tree after inserting G. You need to show the middle step if it happens. Briefly explain the operations.

  • $\begingroup$ You might want to make the question clearer? What do you mean here by middle step? $\endgroup$
    – Russel
    Commented Oct 18, 2021 at 15:05
  • $\begingroup$ That's also a part I'm confused on. The question has no prior question that it's connected to, nor does it elaborate beyond what is shown within my post. I'm sorry for the vagueness. $\endgroup$ Commented Oct 18, 2021 at 15:25
  • 2
    $\begingroup$ @Thomas This is a blunt question. There are many books and online resources to how to balance an AVL tree. You need to tell us what efforts you made and where exactly you got stuck. Also, please consider adding the question in the main body of your post. $\endgroup$ Commented Oct 18, 2021 at 15:25


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.