trees
I know in my main function the root isn't pointing at anything but I'm not sure what to make it point to too be able to traverse the tree.
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
|
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
ofstream outfile;
ifstream infile;
struct Node
{
int value;
Node *Lefty;
Node *Righty;
};
Node *root;
Node *NewNode();
void Insert(Node *c, int NV)
{
Node *p, *tp;
p = NULL;
while(c != NULL)
{
if(c->value > NV)
{
p = c;
c = c->Lefty;
}
else
{
p = c;
c = c->Righty;
}
tp = NewNode();
tp->value = NV;
if(NV < p->value)
{
p->Lefty = tp;
}
else
{
p->Righty = tp;
}
}
}
Node *NewNode()
{
Node *temp;
temp = new Node;
temp->value = 0;
temp->Lefty = NULL;
temp->Righty = NULL;
return temp;
}
void InOrder(Node *c)
{
if(c == NULL)
return;
else
{
InOrder(c->Lefty);
cout << c->value << " ";
InOrder(c->Righty);
}
}
void PreOrder(Node *c)
{
if(c == NULL)
return;
else
{ cout << c->value << " ";
PreOrder(c->Lefty);
PreOrder(c->Righty);
}
}
void PostOrder(Node *c)
{
if(c == NULL)
return;
else
{
PostOrder(c->Lefty);
PostOrder(c->Righty);
cout << c->value << " ";
}
}
int main()
{
int v;
infile.open("TreeInData.txt");
infile >> v;
Insert(root, v);
InOrder(root);
PreOrder(root);
PostOrder(root);
return 0;
}
|
Topic archived. No new replies allowed.