Which of the Following Is the Complete Algorithm for Insertion

Which of the following is the complete algorithm for insertion into an AVL tree?

A) 1. if the root is null
2. Create a new tree with the item at the root and return true.
else if the item is equal to root.data
3. The item is already in the tree; return false.
B) 1. if the root is null
2. Create a new tree with the item at the root and return true.
else if the item is equal to root.data 3. The item is already in the tree; return false. else if the item is greater than root.data 4. The processing is symmetric to Steps1 through 3. Note that balance is incremented if increase is true.
C) 1. if the root is null
2. Create a new tree with the item at the root and return true.
else if the item is equal to root.data
3. The item is already in the tree; return false.
else if the item is less than root.data
4. Recursively insert the item in the left subtree.
5.if the height of the left subtree has increased (increased is true)
6. Decrement balance.
7. if balance is zero, reset increase to false.
8. if balance is less than -1
9. Reset increase to false.
10. Perform a rebalanceLeft.
else if the item is greater than root.data
11. The processing is symmetric to Steps 4 through 10. Note that balance is incremented if increase is true.
D) 1. if the root is null
2. Create a new tree with the item at the root and return true.
else if the item is equal to root.data
3. The item is already in the tree; return false.
4. Recursively insert the item in the left subtree. else if the item is greater than root.data
5. The processing is symmetric to Steps 1 through 4. Note that balance is incremented if increase is true.