AVL Tree balance factor
Author
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.
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.
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.
Author
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).
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).
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
