Code-soln/binarytree.cpp at master · prashanthkammar/Code-soln · 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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
//implementation of binary tree and display elements after each traversals

#include <iostream>
using namespace std;

struct node
{
    int data;
    node *left;
    node *right;
} * root;

class binarytree
{
public:
    binarytree()
    {
        root = NULL;
    }
    void insert(int c)
    {
        node *p = new node;
        p->data = c;
        p->left = NULL;
        p->right = NULL;

        if (root == NULL)
            root = p;
        else
        {
            node *temp = root;
            node *parent;
            while (temp != NULL)
            {
                parent = temp;
                if (c > temp->data)
                    temp = temp->right;
                else
                    temp = temp->left;
            }

            if (c < parent->data)
                parent->left = p;
            else
                parent->right = p;
        }
    }
    void inorder()
    {
        inorder_disp(root);
    }

    void inorder_disp(node *temp)
    {
        if (temp != NULL)
        {
            inorder_disp(temp->left);
            cout << temp->data << " ";
            inorder_disp(temp->right);
        }
    }

    void preorder()
    {
        preorder_disp(root);
    }

    void preorder_disp(node *temp)
    {
        if (temp != NULL)
        {
            cout << temp->data << " ";
            preorder_disp(temp->left);
            preorder_disp(temp->right);
        }
    }

    void postorder()
    {
        postorder_disp(root);
    }

    void postorder_disp(node *temp)
    {
        if (temp != NULL)
        {
            postorder_disp(temp->left);
            postorder_disp(temp->right);
            cout << temp->data << " ";
        }
    }

    void search(int key)
    {
        search(key, root);
    }

    node *search(int key, node *temp)
    {
        if (temp != NULL)
        {
            if (temp->data == key)
                return temp;
            if (key < temp->data)
                return search(key, temp->left);
            else
                return search(key, temp->right);
        }
        else
            return NULL;
    }

    ~binarytree()
    {
        node *temp = root;
        while (temp != NULL)
        {
            temp = temp->left;
            temp = temp->right;
            delete temp;
        }
    }
};

int main()
{
    binarytree b;
    b.insert(20);
    b.insert(10);
    b.insert(5);
    b.insert(15);
    b.insert(40);
    b.insert(45);
    b.insert(30);
    cout << "Inorder traversal:" << endl;
    b.inorder();
    cout << endl
         << "Postorder traversal:" << endl;
    b.postorder();
    cout << endl
         << "Preorder traversal:" << endl;
    b.preorder();

    node *temp = b.search('C', root);
    cout << temp->data;
}