DS-Assignment/BinaryTreeAndBst.cpp at master · geeky1Coder/DS-Assignment · 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
#include <bits/stdc++.h>
using namespace std;

class Node
{
public:
    int data;
    Node *left;
    Node *right;
    Node(int x)
    {
        data = x;
        left = nullptr;
        right = nullptr;
    }
};

Node *bstInsert(Node *root, int data)
{
    if (root)
    {
        if (root->data < data)
        {
            root->right = bstInsert(root->right, data);
        }
        else if (root->data > data)
        {
            root->left = bstInsert(root->left, data);
        }
        return root;
    }
    Node *temp = new Node(data);
    return temp;
}
void inorder(Node *root)
{
    if (root == nullptr)
    {
        return;
    }
    inorder(root->left);
    cout << root->data << " ";
    inorder(root->right);
}
/*
      10
    /   \
   6    13
 / \
4  8
*/
int main()
{
    Node *root = nullptr;
    root = bstInsert(root, 10);
    root = bstInsert(root, 6);
    root = bstInsert(root, 4);
    root = bstInsert(root, 8);
    root = bstInsert(root, 8);
    root = bstInsert(root, 13);
    inorder(root);
    cout << endl;
    return 0;
}