Codes_of_data_stractures_using_cpp/binary_search_tree.cpp at main · sadikmahmudadive/Codes_of_data_stractures_using_cpp · 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
#include <iostream>

using namespace std;

struct Node
{
    int data;
    struct Node* left;
    struct Node* right;

    Node(int val)
    {
        data = val;
        left = NULL;
        right = NULL;
    }
};

Node* insertBst(Node* root, int val)
{
    if(root == NULL)
    {
        return new Node(val);
    }
    if(val < root->data)
    {
        root->left = insertBst(root->left, val);
    }
    else
    {
        root->right = insertBst(root->right, val);
    }
    return root;
}

void inOrder(struct Node* root)
{
    if (root == NULL)
    {
        return;
    }

    inOrder(root->left);
    cout << root->data << "  ";
    inOrder(root->right);
}

void preOrder(struct Node* root)
{
    if (root == NULL)
    {
        return;
    }

    cout << root->data <<"  ";
    preOrder(root->left);
    preOrder(root->right);
}

void postOrder(struct Node* root)
{
    if (root == NULL)
    {
        return;
    }

    postOrder(root->left);
    postOrder(root->right);
    cout << root->data << "  ";
}

int main()
{
    Node *root = NULL;
    root = insertBst(root, 5);
    insertBst(root, 1);
    insertBst(root, 3);
    insertBst(root, 4);
    insertBst(root, 2);
    insertBst(root, 7);

    cout << "In-order: ";
    inOrder(root);
    cout << "Pre-order: ";
    preOrder(root);
    cout << "Post-order: ";
    postOrder(root);

}