binary_search_tree/treeBody.h at master · mritunjay11196/binary_search_tree · 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
//
//  treeBody.h
//  binarySearchTree
//
//  Created by Mritunjay Singh on 30/03/20.
//  Copyright © 2020 Mritunjay Singh. All rights reserved.
//

#ifndef treeBody_h
#define treeBody_h

struct Node
{
    Node* lchild;
    int data;
    Node* rchild;
}*root = nullptr;

void insert(int key)
{
    Node* t = root;
    Node* r = nullptr;
    Node* p;

    if(root == nullptr)
    {
        p = new Node;
        p->data = key;
        p->lchild = p->rchild = nullptr;
        root = p;
        return;
    }

    while(t!=NULL)
    {
        r = t;
        if(key < t->data)
            t = t->lchild;
        else if(key > t->data)
            t = t->rchild;
        else
            return;
    }

    p = new Node;
    p->data = key;
    p->lchild = p->rchild = NULL;

    if(key < r->data)
        r->lchild = p;
    else
        r->rchild = p;
}

void inOrder(Node* p)
{
    if(p)
    {
        inOrder(p->lchild);
        std::cout<<p->data<<" ";
        inOrder(p->rchild);
    }
}

int search(int key)
{
    Node* t = root;
    while(t != nullptr)
    {
        if(key == t->data)
            return t->data;
        else if(key < t->data)
            t = t->lchild;
        else
            t = t->rchild;
    }
    return 0;
}


#endif /* treeBody_h */