Online-coding-problems/doubt.java at master · JaharshKotha/Online-coding-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/*
 * Complete the function below.
 */
public  class Node{

    int val;
    Node left;
    Node right;
    Node(int x)
        {
        val = x;
    }
}

public static Node root = null;

    static void createBST(int[] keys) {
        int len = keys.length;

         if(root == null)
       { root = new Node() ;
        root.val = keys[0];
       }
        for(int i=1;i<len;i++)
            {
            insert(root,keys[i]);

        }

        return root;

    }

public static void insert(Node root, int x)
    {
    Node t = new Node(t);
    Node prev = root;
    while(root!=null)
        {
        prev = root;
        if(x > root.val)
            {
            root = root.right;
        }
        else
            {
            root = root.left;
        }
    }

    if(prev.val > x)
        {
        prev.left = t;
    }
    else
        {
        prev.right = t;
    }
}