• Advertisement
Sign in to follow this  

AVL tree

This topic is 1871 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hello, I am trying to create an AVL tree in java and I'm not quite sure on how I would balance my tree. I'm not too sure on how to start my check or how to begin my check, would I start by checking the depth of both left and right side? But then how would I pin point where to start balancing? I have to use recursion. I'm not looking for code (though if you feel compelled to do so please don't let me stop you) just an explanation.

Thank you for any help.

Share this post


Link to post
Share on other sites
Advertisement
Sign in to follow this  

  • Advertisement