STL-cpp/set.h at master · rushelmac/STL-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
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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
#include<iostream>
using namespace std;
template <typename T>
class node
{
    T data;
    node *left,*right;
public:
    node()
    {
        data=0;
        left=right=NULL;
    }
    node(T d)
    {
        data=d;
        left=right=NULL;
    }
    ~node()
    {
        delete left;
        delete right;
    }
    void setdata(T d)
    {
        data=d;
    }
    void setleft(node* l)
    {
        left=l;
    }
    void setright(node* r)
    {
        right=r;
    }

    node* getleft()
    {
        return left;
    }
    node* getright()
    {
        return right;
    }
    T getdata()
    {
        return data;
    }
};

template <typename T>
class Set
{
    node<T> *root;
    int size1;
public:
    Set()
    {
        root=NULL;
        size1=0;
    }

    void insert(T);
    bool search(T);
    void display(node<T>*); //inorder traversal
    node<T>* getroot()
    {
        return root;
    }
    int size()
    {
        return size1;
    }
    bool empty()
    {
        return root==NULL;
    }

};

template <typename T>
void Set<T>::insert(T d)
{
    if(search(d)==true)
        return;
    else
    {
        int flg=0;
        node<T> *a,*b;
        while(1)
        {
            if(root==NULL)
            {
                a=new node<T>(d);
                root=a;
                break;
            }
            else
            {
                b=root;
                while(1)
                {
                    if(d<b->getdata())
                    {
                        if(b->getleft()==NULL)
                        {
                            a=new node<T>(d);
                            b->setleft(a);
                            flg=1;
                            break;
                        }
                        else
                            b=b->getleft();
                    }
                    else
                    {
                        if(d>b->getdata())
                        {
                            if(b->getright()==NULL)
                            {
                                a=new node<T>(d);
                                b->setright(a);
                                flg=1;
                                break;
                            }
                            else
                                b=b->getright();
                        }
                    }
                }
                if(flg==1)
                    break;
            }
        }
    }
    size1++;
}
template <typename T>
bool Set<T>::search(T sv)
{
    if(root==NULL)
        return false;
    node<T> *a=root;
    int flg=0;
    while(1)
    {
        if(sv==a->getdata())
        {
            flg=1;
            break;
        }
        else if(sv<a->getdata())
        {
            if(a->getleft()==NULL)
                break;
            else
            {
                a=a->getleft();
            }
        }
        else if(sv>a->getdata())
        {
            if(a->getright()==NULL)
                break;
            else
            {
                a=a->getright();
            }
        }
    }
    return flg==1;
}


template <typename T>
void Set<T>::display(node<T>* curr)
{
    if(curr==NULL)
        return ;
    else
    {
        display(curr->getleft());
        cout<<curr->getdata()<<" ";
        display(curr->getright());
    }
}