Practice-Questions-of-java/BinaryTree.java at main · IshikaSahu24/Practice-Questions-of-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
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
71
72
73
74
75
class Node {

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

    }
}
public class BinaryTree {

    Node root ;
    public void insertnode(int data){
        root = insert(root, data);
            }


    private Node insert(Node root, int data) {
         if(root == null)
            root = new Node(data);
         else if(root.data > data)
            root.left = insert(root.left, data);
         else if(root.data < data)
            root.right = insert(root.right, data);

        return root;
}

public void inorder(){
     inorderrec(root);
     System.out.println();
}

public void inorderrec(Node root){
    if (root != null) {

    inorderrec(root.left);
    System.out.print(root.data+" ");
    inorderrec(root.right);
}

 }

 public void preorder(){
    preorderrec(root);
    System.out.println();
}

public void preorderrec(Node root){
   if (root != null) {
    System.out.print(root.data+" ");
   preorderrec(root.left);

   preorderrec(root.right);
}

}

public void postorder(){
    postorderrec(root);
}

public void postorderrec(Node root){
   if (root != null) {

   postorderrec(root.left);

   postorderrec(root.right);
   System.out.print(root.data+" ");
}

}

}