Subject. Data structure In Java. Please answer me fully, if you know it only. As soon as possible. Hand written is ok. Make sure the answer is correct. If you are confused, please dont answer. Number. 13 Thank you.

3. Give a definition of an AVL tree. Draw the AVL tree resulting from the insertion of an entry with key 52 into the AVL tree of Figure 11.13b below. 17 5 17 48 7 Figure 11.13: Deletion of the entry with key 32 from the AVL tree of Figure 11.1lb: (a) after removing the node storing key 32, the root becomes unbalanced; (b) a trinode restructuring of x.y, and z restores the height-balance property