Please explain

Assume that you have an AVL tree like below. To the sample AVL tree, add a number 65. For the resulting AVL tree after the addition, choose the correct ivel 1, For the 2-3 tree problems in the quiz, use the level-by-level order to represent them: root node is considered level 0 , then level 1, and so on. For the sample 2-3 tree below, the root value 50 is the level 0 . And 10 and 70 are the level 1 . For the 23 tree, add a number "90" After that, add a number "100". This is a max heap. True False