Repository navigation
Expand file tree
/
Copy pathBinaryTree.cpp
More file actions
171 lines (132 loc) · 3.16 KB
/
Copy pathBinaryTree.cpp
File metadata and controls
171 lines (132 loc) · 3.16 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <iostream>
typedef char ElementType;
typedef struct BTNode {
ElementType data;
BTNode *pLchild;
BTNode *pRchild;
} BTNode, *BTree;
BTree create_tree();
void pre_traverse(BTree);
void in_traverse(BTree);
void beh_traverse(BTree);
BTree create_tree() {
BTree pA = (BTree) malloc(sizeof(BTNode));
BTree pB = (BTree) malloc(sizeof(BTNode));
BTree pC = (BTree) malloc(sizeof(BTNode));
BTree pD = (BTree) malloc(sizeof(BTNode));
BTree pE = (BTree) malloc(sizeof(BTNode));
BTree pF = (BTree) malloc(sizeof(BTNode));
BTree pG = (BTree) malloc(sizeof(BTNode));
pA->data = 'A';
pB->data = 'B';
pC->data = 'C';
pD->data = 'D';
pE->data = 'E';
pF->data = 'F';
pG->data = 'G';
pA->pLchild = pB;
pA->pRchild = pC;
pB->pLchild = pD;
pB->pRchild = pE;
pD->pLchild = pD->pRchild = NULL;
pE->pLchild = pD->pRchild = NULL;
pC->pLchild = pF;
pC->pRchild = pG;
// pC->pRchild = NULL;
pF->pLchild = pF->pRchild = NULL;
return pA;
}
void pre_traverse(BTree pTree) {
if (pTree) {
printf("%c ", pTree->data);
if (pTree->pLchild) {
pre_traverse(pTree->pLchild);
}
if (pTree->pRchild) {
pre_traverse(pTree->pRchild);
}
}
}
void in_traverse(BTree pTree) {
if (pTree) {
if (pTree->pLchild)
in_traverse(pTree->pLchild);
printf("%c ", pTree->data);
if (pTree->pRchild)
in_traverse(pTree->pRchild);
}
}
void beh_traverse(BTree pTree) {
if (pTree) {
if (pTree->pLchild)
beh_traverse(pTree->pLchild);
if (pTree->pRchild)
beh_traverse(pTree->pRchild);
printf("%c ", pTree->data);
}
}
BTree inverTree(BTree tree) {
if (tree == NULL) {
return tree;
}
BTree tmp = tree->pLchild;
tree->pLchild = tree->pRchild;
tree->pRchild = tmp;
inverTree(tree->pLchild);
inverTree(tree->pRchild);
return tree;
}
//下面是非递归遍历
using std::stack;
void PreOrderTraverse(BTree T)//非递归先序遍历
{
stack<BTree> Stack;
if (!T) {
printf("空树！\n");
return;
}
while (T || !Stack.empty()) {
while (T) {
Stack.push(T);
printf("%c", T->data);
T = T->pLchild;
}
T = Stack.top();
Stack.pop();
T = T->pRchild;
}
}
//非递归 反转二叉树；
BTree InvertTree(BTree tree) {
if (tree == NULL) {
return tree;
}
stack<BTree> stack;
stack.push(tree);
while (!stack.empty()) {
BTree top=stack.top();
stack.pop();
BTree tmp=top->pLchild;
top->pLchild=top->pRchild;
top->pRchild=tmp;
if(top->pLchild) stack.push(top->pLchild);
if(top->pRchild) stack.push(top->pRchild);
}
return tree;
}
/*
int main() {
BTree tree = create_tree();
//递归Demo:
// inverTree(tree);
pre_traverse(tree);
std::cout<<"\n";
InvertTree(tree);
pre_traverse(tree);
// in_traverse(tree);
// 非递归Demo:
// PreOrderTraverse(tree);
}*/