program not holding assigned value, sets it to null

Hello, The program compiles, but its not doing what it suppose to. The program creates a tree and connects to the root, but when it exists out, after creating it the root is set back to null, i am not sure why, i am passing the root pointer it self.

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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
#include <iostream>

using namespace std;





class Tree

{

    private:

                Tree * left;

                int Data;

                Tree * right;



    public:

                Tree(int a);

                void setdata(int);

                void setleft(Tree *);

                void setright(Tree *);

                Tree * getleft();

                Tree * getright();

                int getdata();

                void print(Tree *);

                void search (Tree *,int);

};



Tree::Tree(int a)

{

    Data = a;

    left =NULL;

    right = NULL;

}



void Tree::setdata(int given)

{

    Data = given;



}



void Tree::setleft(Tree * lft_tree)

{

    left = lft_tree;

}



void Tree::setright(Tree * rgt_tree)

{

    right = rgt_tree;

}



Tree * Tree::getleft()

{

    return (left);

}



Tree * Tree::getright()

{

    return (right);

}



int Tree::getdata()

{

    return (Data);

}

void Tree::print(Tree * root)

{

    if(root != NULL)

    {

        cout<<"in the print"<<endl;

        print(root->getleft());

        cout<<root->Data<<endl;

        print(root->getright());

    }



}



void Tree::search(Tree * root,int a)

{

    if(root !=NULL)

    {

        cout<<"in search"<<endl;

        if(root->getdata()==a)

        {

            cout<<root->getdata()<<endl;

            cout<<"found"<<endl;

        }

        else

        {

            if(a>root->getdata())

            {

                search(root->getleft(),a);

            }

 else  if(a<root->getdata())

            {

                search(root->getright(),a);

            }



        }

    }

       // cout <<"Not found"<<endl;





}

///**************************************************

class head

{

    private:

                Tree * big;

    public:

                head();

                void setbig(Tree *);

                void newtree(int);

                Tree * getbig();

                void searchandinsert(Tree *,int);

                void print();



};

void head::print()

{

    cout<<"in head print"<<endl;

    big->print(big);

    cout<<"missed"<<endl;

}

head::head()

{

    big =NULL;

}



void head::setbig(Tree * give)

{

    big = give;

}



Tree * head::getbig()

{

    return big;

}



void head::newtree(int x)

{

searchandinsert(big,x);





}



void head::searchandinsert(Tree * root, int x)

{

    if(root == NULL)

    {

        root = new Tree(x);

    }

    if(x>root->getdata())

    {

        searchandinsert(root->getleft(),x);

    }

    if(x<root->getdata())

    {

        searchandinsert(root->getright(),x);

    }

}
 /// WHEN PROGRAM EXIT OUT OF HERE THE NEW DATA IS LOST, ROOT IS BACK TO NULL
///****************************************

int main()

{


head root;

root.newtree(5);

root.newtree(8);

root.print();





}


i used DDD debugger to trace it. any one know what's the error here? Thank you in advance
Last edited on
That is because you aren't modifying root, you are modifying a copy of it. Pass it by reference or pointer if you need to change the value.
so i would say,
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
class head

{

    private:

                Tree * big;

    public:

                head();

                void setbig(Tree *);

                void newtree(int);

                Tree * getbig();

                void searchandinsert(Tree *&,int);

                void print();
};
...
..
void head::newtree(int x)

{

searchandinsert(&big,x);

}

void head::searchandinsert(Tree *& root, int x)

{

    if(root == NULL)

    {

        root = new Tree(x);

    }

    if(x>root->getdata())

    {

        searchandinsert(&root->getleft(),x);

    }

    if(x<root->getdata())

    {

        searchandinsert(&root->getright(),x);

    }

}


Help please.
Topic archived. No new replies allowed.