datastructure java . please right asap

1. For the tree shown in this figure, determine: The result of preorder, postorder, inorder, and level-order traversals (22) root 36 18 26 (11 39 97 88 63 2. Show the result of inserting 10, 12, 1, 14, 6, 5, and 7 in an initially empty binary search tree. Then show the result of deleting the root. 3. Given the input {12, 14, 3, 9,4, 18, 21,7), a fixed table size of 10, and a hash function H(X)= X mod 8, show the resulting a. Linear probing hash table b. Quadratic probing hash table