Crowdly
Add to Chrome
Consider the following AVL tree. Initial directed AVL tree A directed...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Consider the following AVL tree.
Initial directed AVL tree
A directed AVL tree with root 44. Edges point from each parent to its child.
44
31
67
18
36
53
81
13
24
59
The following operations are then performed in order:
- Insert 7
- Delete 81
- Insert 48
Assume that inserting a key already present in the tree leaves the tree unchanged. After each successful insertion or deletion, standard AVL rebalancing is performed.
Tick all keys whose node balance factor is +1 in the resulting AVL tree, i.e. the height of the left subtree is greater than the height of the right subtree.
100%
100%
100%
0%
0%
0%
0%
0%
0%
0%
0%
0%