Sign in to follow this  
snooty

AVL Tree balance factor

Recommended Posts

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

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this