Answers must be in java language

Lab 6, 7 Trees, Binary search trees Lab 6 Task 1 We define the following class Node class Node \{ int data; Node left; Node right; public Node(int data)\{ this.data=data; left = null; right = null; \} public String toString() return data + " "; \} Task 2 Define the class BST public class Bst \{ Node root; public Bst() \{ root = null; \} Task 3 Complete the iterative implementation below to insert a key in a BST: public void insert( int x){ Node n= new Node(x); \} Task 4 Complete the recursive implementation below to insert a key in a BST: private void insertR(Node start, int x){ 3 public void insertRec(int x){ insertR(root, x); \} Task 5 (Done) Complete the implementation below to search for the minimum in a BST: private int minimum(Node root)\{ int min= root.data; while (root. left != null)\{ min= root.left. data; root = root.left; 3 return min; \} Task 6 (Done) Complete the implementation below to delete an element in a BST: private Node delete_Recursive(Node root, int key)\{ if ( root == null) return root; if (key // traverse left subtree root.left = delete_Recursive(root.left, key); else if (key > root data) // traverse right subtree root.right = delete_Recursive(root.right, key); else\{ // node contains only one child if ( root.left = null) return root.right; else if (root.right = null) return root.left; root data = minimum ( root right ); root.right = delete_Recursive(root.right, root.data); \} return root; ) void delete(int key) \{ root = delete_Recursive(root, key); \} Lab 7 Task 7 Create the following Tree on slide 26 using the methods implemented in Lab 6. Task 8 Implement the methods inorder, preorder and postorder seen in the lecture. Task 9 Apply the methods implemented in Task 8 to the Tree and verify that you obtain the following results : Preorder Traversal: 3,13,22,19,26,54,71,33,14,11,87,8,56,9,75,28,15,10,63,36,7,69, 59,68,44 Inorder Traversal: 54,26,71,19,22,11,14,33,8,87,56,13,9,75,3,63,10,15,28,59,69,68, 7,36,44 Postorder Traversal: 54,71,26,19,11,14,8,56,87,33,22,75,9,13,63,10,15,59,68,69,7,44