When does a binary search tree (BST) become a skewed tree? What is an AVL Tree? What are its advantages over a BST? Write an explanatory note on AVL rotations. For the AVL Tree shown in Figure 10.41,...

When does a binary search tree (BST) become a skewed tree?

What is an AVL Tree? What are its advantages over a BST?

Write an explanatory note on AVL rotations.

For the AVL Tree shown in Figure 10.41, label each node in the AVL Tree with the correct balance factor. Use 1 for left higher, 0 for equal height, and −1 for right higher subtrees.