DSAcodes/BSTtreeOrder.cpp at master · ankit-songara/DSAcodes · 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
#include <iostream>
using namespace std;

struct bstnode
{
    struct bstnode *lc;
    int data;
    struct bstnode *rc;
};

typedef struct bstnode *BSTPTR;

void insert(BSTPTR &T, int k)
{
    if (T == NULL)
    {
        T = new (bstnode);
        T->data = k;
        T->lc = NULL;
        T->rc = NULL;
    }
    else
    {
        if (k < T->data)
        {
            insert(T->lc, k);
        }
        else
        {
            insert(T->rc, k);
        }
    }
}

void preorderprint(BSTPTR T)
{
    if (T != NULL)
    {
        cout << T->data << " ";
        preorderprint(T->lc);
        preorderprint(T->rc);
    }
}

void inorderprint(BSTPTR T)
{
    if (T != NULL)
    {
        inorderprint(T->lc);
        cout << T->data << " ";
        inorderprint(T->rc);
    }
}

void postorderprint(BSTPTR T)
{
    if (T != NULL)
    {
        postorderprint(T->lc);
        postorderprint(T->rc);
        cout << T->data << " ";
    }
}

void find(BSTPTR T, int k)
{
    if (T == NULL)
    {
        cout << "0";
    }

    else if (T->data == k)
    {
        cout << "1";
    }

    else
    {
        if (k < T->data)
        {
            find(T->lc, k);
        }

        else if (k > T->data)
        {
            find(T->rc, k);
        }
    }
}

int min(BSTPTR T)
{
    if (T->lc != NULL)
        return min(T->lc);
    else
        return T->data;
}

int max(BSTPTR T)
{
    if (T->rc != NULL)
        return max(T->rc);
    else
        return T->data;
}

int main()
{
    BSTPTR T2;
    T2 = NULL;
    int n,a,b;
    while(n!=-1)
    {
        cin>>n;
        if(n==-1) break;
        insert(T2,n);
    }
    preorderprint(T2);
}