관리 메뉴
안선생의 개발 블로그
C++ tree 본문
treeC.cpp
|
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
|
#include<iostream>
#include "Queuec++.h"
using namespace std;
class tree
{
public:
Node* root;
tree() { root = NULL; }
void CreateTree();
void preorder() { preorder(root); }
void preorder(Node* p);
void postorder(Node* p);
void inorder(Node* p);
void Levelorder(Node* p);
int Height(Node* root);
void LevelOrder2(Node* root);
};
void tree::CreateTree()
{
Node* p, * t;
int x;
Queue q(100);
cout << "enter root";
cin >> x;
root = new Node;
root->data = x;
root->lchild = root->rchild = NULL;
q.enqueue(root);
while (!q.isEmpty())
{
p = q.dequeue();
cout << "enter left child";
cin >> x;
if (x != -1)
{
t = new Node;
t->data = x;
t->lchild = t->rchild = NULL;
p->lchild = t;
q.enqueue(t);
}
cout << "enter right child";
cin >> x;
if (x != -1)
{
t = new Node;
t->data = x;
t->lchild = t->rchild = NULL;
p->rchild = t;
q.enqueue(t);
}
}
}
void tree::preorder(Node* p)
{
if (p)
{
cout << p->data << " ";
preorder(p->lchild);
preorder(p->rchild);
}
}
void tree::inorder(Node* p)
{
if (p)
{
inorder(p->lchild);
cout << p->data << " ";
inorder(p->rchild);
}
}
void tree::postorder(Node* p)
{
if (p)
{
postorder(p->lchild);
postorder(p->rchild);
cout << p->data << " ";
}
}
void tree::Levelorder(Node* root)
{
Queue q(100);
cout << root->data;
q.enqueue(root);
while (!q.isEmpty())
{
root = q.dequeue();
if (root->lchild)
{
cout << root->lchild->data;
q.enqueue(root->lchild);
}
if (root->rchild)
{
cout << root->rchild->data;
q.enqueue(root->rchild);
}
}
}
int conut(Node* root)
{
if (root)
return conut(root->lchild) + conut(root->rchild) + 1;
return 0;
}
int tree::Height(Node* root)
{
int x = 0, y = 0;
if (root == 0)
return 0;
x = Height(root->lchild);
y = Height(root->rchild);
if (x > y)
return x + 1;
else
return y + 1;
}
void tree::LevelOrder2(Node* root)
{
Queue q(100);
cout << root->data<< " ";
q.enqueue(root);
while (!q.isEmpty())
{
root = q.dequeue();
if (root->lchild)
{
cout << root->lchild->data<< " ";
q.enqueue(root->lchild);
}
if (root->rchild)
{
cout << root->rchild->data<< " ";
q.enqueue(root->rchild);
}
}
}
int main()
{
tree t;
t.CreateTree();
/*cout << "Preorder ";
t.preorder();
cout << endl;
cout << "inoredr ";
t.inorder(t.root);*/
t.LevelOrder2(t.root);
int i = 0, q = 0;
while (i == 0 || q == 1)
{
i++;
q++;
}
cout << q;
return 0;
}
|
cs |
Queue.h
|
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
|
#include <iostream>
using namespace std;
class Node
{
public:
Node* lchild;
int data;
Node* rchild;
};
class Queue
{
private:
int size;
int front;
int rear;
Node ** q;
public:
Queue()
{
size = 10;
front = rear = -1;
q = new Node*[size];
}
Queue(int size)
{
this->size = size;
front = rear = -1;
q = new Node*[this->size];
}
void enqueue(Node* x);
Node* dequeue();
void Display();
int isEmpty() {return front == rear;}
};
void Queue::enqueue(Node* x)
{
if (rear == size - 1)
cout << "full queue";
else
{
q[++rear] = x;
}
}
Node* Queue::dequeue()
{
Node* x = NULL;
if (front == rear)
cout << "empty";
else
{
x = q[++front];
}
return x;
}
|
cs |