AVL tree

Started by bakshadow, Dec 04 2012 10:28 AM

java tree

Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

You cannot reply to this topic

No replies to this topic

#1 bakshadow Members - Reputation: 148

0Likes

Posted 04 December 2012 - 10:28 AM

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.

Sponsor:

Back to General Programming

Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.