Given the following integers, insert them into the following binary search tree. Include the string "null" if there are blanks in the tree. 52, 13, 26, 83, 57, 10, 89 You can use scratch paper to draw...

Extracted text: Given the following integers, insert them into the following binary search tree. Include the string "null" if there are blanks in the tree. 52, 13, 26, 83, 57, 10, 89 You can use scratch paper to draw the tree, then answer the following questions.Make sure to write a question number for each answer : 1. What is the root? 2. What is the root of the left sub-tree? 3. What is the left leaf of the left sub-tree? 4. What is the right leaf of the left sub-tree? 5. What is the root of the right sub-tree? 6. What is the left leaf of the right sub-tree? 7. What is the right leaf of the right sub-tree? 8. Given the above binary search tree, what is the inorder traversal? 9. Given the above binary search tree, what is the postorder traversal? 10. Given the above binary search tree, what is the preorder traversal?