Binary Search Trees && AVL Trees question

Assume this tree on the right is a binary search tree even though you cannot see what the keys and values are at the nodes (the letters we write below are just names" for the nodes for the purpose of answering the questions) e. i. What node is the successor of node A? J i. What node is the successor of node B? E i1i. What node is the successor of node C? K iv. What is the height of the tree? v. What is the maximum number of nodes that could vi. vii. viii. ix. be added to the tree without increasing its height? Is the tree an AVL tree? Ifwe remove only node H, is the result an AVL tree? If we remove only node J, is the result an AVL tree? Ifwe remove only node K, is the result an AVL tree