DSAcodes/BST_Serialization.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
#include <iostream>
using namespace std;

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

typedef 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 != 0)
        {
            if (k < T->data)
            {
                insert(T->lc, k);
            }
            else
            {
                insert(T->rc, k);
            }
        }
    }
}

void preorderprintSerialization(BSTPTR T)
{
    if (T == NULL)
    {
        cout << "0"
             << " ";
    }
    else
    {
        cout << T->data << " ";
        preorderprintSerialization(T->lc);
        preorderprintSerialization(T->rc);
    }
}

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

int main()
{
    BSTPTR T2, T1;
    T2 = NULL;
    T1 = NULL;
    int n, t=19,a;
    while (n != -1)
    {
        cin >> n;
        if (n == -1)
            break;
        insert(T2, n);
    }
    preorderprintSerialization(T2);
}