Deletion for AVL tree

[kun qian]

How do you choose successor for an AVL tree after deletion? Is it the
defintion of succ we had for assignment 3?

[cs240]

Deletions from AVL trees are similar to deletions from Binary search
trees, so you have three cases to consider. See slide 83 to review the
three cases. Only for the third case, you will need to find the in-order
successor, which is the left-most child of the right subtree. Note that
this successor will have at most 1 child.

Vivian
CS240 Tutor

Post by kun qian
How do you choose successor for an AVL tree after deletion? Is it the
defintion of succ we had for assignment 3?