Q.1 Draw the AVL tree after each of the following inserts in succession, i.e., one after the other, 1. Insert (5) 2. Insert (2) 3. Insert (1) 4. Insert (6) 5. Insert (7) 6. Insert (4) Q. 2 Consider the following AVL tree. [Image of an AVL tree with nodes: 50 at root, with 30 and 70 as children, 20 and 40 as children of 30, 60 and 80 as children of 70, 35 as child of 40, 65 as child of 60, 75 and 85 as children of 80, and 90 as child of 85] Show the modified AVL tree after each of the following operations. (Note perform these operations in sequence as given below) - Show the tree after deleting the node 80. - Show the AVL tree after deleting the node 50. - Show the AVL tree after inserting the node 79.
The answer is in this YouTube short video: https://youtube.com/shorts/kl_npSMaTBk?si=WRTxacMBFo9sFpBf
Question 12.1. Let A=[01-10]. Find the values of α,βinR such that(αI2+βA)2=A.
4- Calculate the number of connections and the number of trainable parameters (weights) of...