Problem 1: Draw a BST(Right Biased) for the following sequence 22 63 78 29 10 96 28 35 12 9 4 33 58 12 10 97 35 77 65 36 96 Problem 2: Draw an AVL tree for following 1 8 6 4 7 3 9 5 6 2 3 Problem 3: Write a program in C to print following pattern (*) using only one loop when n is entered by user at runtime. Problem 4: Write a program in c to create a new datatype to store the detailed information of student containing following information a. pointer to next student b. pointer to previous student c. id of student d. marks of 5 subjects e. pointer to the teacher details pointer f. recently contacted time format hours and minutes only (store time using one variable only) Problem 6: Write a program in C to print numbers from n1 to n2 and n2 to n1, n times where n1, n2 and n are entered by user at runtime. Example: n1=10 n2=13 n=2 Output: 10 11 12 13 12 11 10 11 12 13 12 11 10
