I will give you some Java quiz kind of question, please help me in doing these. Build the binary search tree that results from adding the characters in the string: STRAWBERRY (in this order). Show the string that results from a POSTORDER traversal of the resulting tree. Your answer should be a single string of characters with NO quotation symbols, NO intervening spaces, NO commas, etc. 2. Build the binary search tree that results from adding the characters in the string CAREFULLY (in this order). Show the string that results from a PREORDER traversal of the resulting tree. Your answer should be a single string of characters with NO quotation symbols, NO intervening spaces, NO commas, etc. 3. Most authors define the height of a tree as the number of edges along the path from the root to the farthest leaf. For example, the height of the tree below is 2 (because there are two edges from the root to the farthest leaf): Build the binary search tree that results from adding the characters in the string: MYSTERYTOUR (in this order). Using the definition above, what is the height of the resulting tree? (enter a single digit) 4. Build the binary search tree that results from adding the characters in the string: SUBMARINES (in this order). When searching for elements in the tree, it takes Answer element comparisons to find element R, and it takes Answer element comparisons to determine that G is not in the tree.