CodeJava/BST.java at master · sidhant55/CodeJava · 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
//Created by sidhant
//27/03/2017

//Deletion of a node or vertices is in progress.

import java.util.*;
class node
{
    int val;
    node left;
    node right;
}
public class BST
{
    static void inorder (node h)
    {
        if (h!=null){
        inorder(h.left);
        System.out.print(h.val+" ");
        inorder(h.right);
    }
    }
    static void preorder (node h)
    {
        if (h!=null){
        System.out.print(h.val+" ");
        preorder(h.left);
        preorder(h.right);
    }
    }
    static void postorder (node h)
    {
        if (h!=null){
        postorder(h.left);
        postorder(h.right);
        System.out.print(h.val+" ");
    }
    }
    public static void main (String args[])
    {

        Scanner in=new Scanner (System.in);
        node head=null;
        int c=0;
        while (true)
        {
            System.out.println("1.to enter \n2.to delete \n3.to print \n4.to break");
            int t=in.nextInt();
            if (t==1)
            {
            c++;
            if (c==1)
            {
                head=new node();
                head.val=in.nextInt();
                head.left=null;
                head.right=null;
            }
            else
            {
                int p=in.nextInt();
                node b=new node();
                b.val=p;
                b.right=null;
                b.left=null;
                node d=head;
                while (true)
                {
                    if(b.val<d.val)
                    {
                        if (d.left==null){
                        d.left=b;
                        break;
                    }
                    else
                        d=d.left;
                    }
                    if(b.val>d.val)
                    {
                        if (d.right==null){
                        d.right=b;
                        break;
                    }
                    else
                        d=d.right;
                    }
                }

            }
            }
            if (t==4)
            break;
           if (t==3)
           {
               System.out.println("1.for inorder\n2.for preoder \n3.for postorder");
               int u=in.nextInt();
               if (u==1)
               inorder(head);
               if (u==2)
               preorder(head);
               if (u==3)
               postorder(head);
               System.out.println();
           }
        }
    }
}