BinarySearchTree-dataStructure/Tree.java at master · AliMirzaliyev/BinarySearchTree-dataStructure · 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
60
61
62
63
64
65
66
67
68
69
70
package FirstProgram;

public class Tree {

    private Nodes root;

    public Tree() {
        root = null;
    }

    public Tree(Nodes newNode) {
        root = newNode;
    }

    public boolean isEmpty() {
        return root == null;
    }
    public boolean search ( int value){
        Nodes newRoot = root;
        while(newRoot != null){
        if(newRoot.getElement() == value )
            return true;
        else if(newRoot.getElement() > value)
        newRoot = newRoot.getLeft();
        else{
        newRoot = newRoot.getRight();
        }

        }
         return false;

    }

    public void add(int newValue)
    {
        Nodes node = new Nodes(newValue,null,null);

        if(isEmpty())
            root = node;
        else
        {
            Nodes oldNode = root;

            while(true)
            {
                if(newValue < oldNode.getElement())
                {
                    if(oldNode.getLeft() == null)
                    {
                        oldNode.setLeft(node);
                        break;
                    }
                    else
                        oldNode = oldNode.getLeft();
                }
                else
                {
                    if(oldNode.getRight() == null)
                    {
                        oldNode.setRight(node);
                        break;
                    }
                    else
                        oldNode = oldNode.getRight();
                }
            }
        }
    }

}