a$)$

b$)$

ct one or more:

a$.$ Tree in a$)$ has the AVL $($height$-$balanced $1-$tree$)$ property

b$.$ For tree a$),$ if we add a left child to Modde D$,$ then the tree does no lon

AVL property.

c$.$ Tree in b$)$ does not have the AVL property.

d$.$ For a binary tree that does have the AVL property. If the property is

deleting a node, then the property can be restored using an algorith

rotations$)$ that runs in exponential time where $N$ is the numb

For tree a$),$ if we add a right child to node $C,$ then the tree does no

AVL property.