Jump to content
  • Advertisement
Sign in to follow this  
snooty

AVL Tree balance factor

This topic is 4425 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

Hi, I'm trying to implement an AVL Tree, but am stuck at updating the balance factor after deletion. I simply don't know how to do it. Please help.

Share this post


Link to post
Share on other sites
Advertisement
As I was taught, you're supposed to find another node to replace the one you're removing. Be it the righmost node from left sub-tree or leftmost node from right subtree (subtrees -> of node being removed).

After that the problem transforms to "removal of a leaf node" - which shouldn't be too different from inserting a node (which always inserts a new leaf) - you already got that, am I right?

For more detailed description, look "Introduction to algorithms" by Cormen et.al.

Share this post


Link to post
Share on other sites
Thanks for the reply.

I understand how to perform deletion, and am able to make it work. The only thing that keeps me from going is to update the balance factor after deletion (or more precisely, after rotations).

Share this post


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

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!