Discussion:
Recursive delete for AVL trees
(too old to reply)
kun qian
2011-10-23 01:13:20 UTC
Permalink
Have we covered recursive delete for AVL tree? I believe the professor
has only talked about deleting the child leafs and rotations.
cs240
2011-10-23 18:30:16 UTC
Permalink
For recursive deletions, you just repeat the same rotation steps until
the tree becomes balanced again, potentially from the node you are deleting all
the way up to the root node. I did an example of AVL Tree deletion in last
week's tutorial. You can borrow someone else's notes if you missed the tutorial.

Vivian
CS240 Tutor
Post by kun qian
Have we covered recursive delete for AVL tree? I believe the professor
has only talked about deleting the child leafs and rotations.
kun qian
2011-10-23 22:11:43 UTC
Permalink
Post by cs240
For recursive deletions, you just repeat the same rotation steps until
the tree becomes balanced again, potentially from the node you are deleting all
the way up to the root node. I did an example of AVL Tree deletion in last
week's tutorial. You can borrow someone else's notes if you missed the tutorial.
Vivian
CS240 Tutor
Post by kun qian
Have we covered recursive delete for AVL tree? I believe the professor
has only talked about deleting the child leafs and rotations.
Alright thanks.

Loading...