JAVA please

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){

}

public void insertRec(int x){

insertR(root,x); }