Given the following labeled data structure: A В D E F H J K M Assume that values are inserted into the binary search tree (BST) in the following order: 20, 35, 5, 19, 3, 28, 26, 16, 4, 31, 50, 42 Match the labels in each node shown in the diagram with the value that the node will contain after all the values have been inserted into the Binary Search Tree. (Note: Some nodes will not have a value.)

Course: Data Structure and Algorithms Language: Java Topic: AVL Tree Kindly solve this question prperly step by step and complete.   AVL Tree basics Draw the AVL tree after performing each of the following operations consecutively on an initially empty binary search tree: insert 8, insert 6, insert 12, insert 3, insert 10, insert 9, delete 12, delete 8, insert 7, insert 8.  If you delete an item from an AVL tree and then insert it back into the tree, will you always get back the original AVL tree? Justify your answer.

8-Write a procedure that takes a tree (represented as a list) and returns a list whose elements are all the leaves of the tree arranged in right to left order or left to right. For example, ( leaves '((1 2) ((3 4) 5 )) returns (1 2 3 4 5) or (5 4 3 2 1). Then, Manually trace your procedure with the provided example.

Insert: 73, 35, 68, 94, 26, 29, 16, 44, 38, 81, 59, 61 draw 2-3-4 tree showing each value inserted using the following insertion sequence: