안선생의 개발 블로그
tree 본문
tree.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
|
#include<stdio.h>
#include "Htree.h"
using namespace std;
struct Node* root = NULL;
void Treecreate()
{
struct Node* p, * t;
int x;
Queue q;
create(q, 100);
cout << "enter root";
cin >> x;
root = new Node;
root->data = x;
root->lchild = root->rchild = NULL;
enqueue(&q, root);
while (!isEmpty(q))
{
p = dequeue(&q);
cout << "enter left child";
cin >> x;
if (x != -1)
{
t = new Node;
t->data = x;
t->lchild = t->rchild = NULL;
p->lchild = t;
enqueue(&q, t);
}
cout << "enter right child";
cin >> x;
if (x != -1)
{
t = new Node;
t->data = x;
t->lchild = t->rchild = NULL;
p->rchild = t;
enqueue(&q, t);
}
}
}
void preorder(Node* p)
{
if (p)
{
cout << p->data << " ";
preorder(p->lchild);
preorder(p->rchild);
}
}
void inorder(Node* p)
{
if (p)
{
preorder(p->lchild);
cout << p->data << " ";
preorder(p->rchild);
}
}
void postorder(Node* p)
{
if (p)
{
preorder(p->lchild);
preorder(p->rchild);
cout << p->data << " ";
}
}
int main()
{
Treecreate();
//preorder(root);
inorder(root);
return 0;
}
|
cs |
tree.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
|
#include<iostream>
using namespace std;
struct Node
{
Node* lchild;
int data;
Node* rchild;
};
struct Queue
{
int size;
int front;
int rear;
Node** q;
};
void create(Queue& q, int size)
{
q.size = size;
q.front = q.rear = -1;
q.q = new Node * [q.size];
}
void enqueue(Queue* q, Node* x)
{
if (q->rear == q->size - 1)
cout << "Queue is FUll";
else
{
q->q[++q->rear] = x;
}
}
Node* dequeue(Queue* q)
{
Node* x = NULL;
if (q->front == q->rear)
cout << "Queue is Empty";
else
{
x = q->q[++q->front];
}
return x;
}
int isEmpty(Queue q)
{
return q.front == q.rear;
}
|
cs |