Consider the AVL tree T shown below where keys are shown inside the nodes, but the node heights are not shown. Now suppose we delete $51$ according to the dictionary delete algorithm on AVL trees described in the course $($i$.$e$.,$ lecture slide video recordings$)$

Question $11$Answer

a$.$

Left subtree of the root remains unchanged, depth of $85$ remains $3,$ and $93$ becomes right child of $85$

b$.$

$63$ becomes the root, and $81$ becomes right child of $79$

c$.$

Left subtree of the root remains unchanged, and $71$ becomes parent of $79$

d$.$

$63$ becomes the root, $71$ and $81$ become siblings, and $85$ remains left child of $93$