Java/binary tree.java at main · Jabeen2003/Java · 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
class Node {
    int data;
    Node left, right;

    public Node(int data) {
        this.data = data;
        left = right =null;
    }
}

class BinaryTree {
    Node root;

    BinaryTree() {
        root = null;
    }


    Node insert(Node node, int data) {

        if (node == null) {
            node = new Node(data);
            return node;
        }


        if(data < node.data) {
            node.left = insert(node.left, data);
        } else if (data > node.data) {
            node.right = insert(node.right, data);
        }


        return node;
    }
}