-
Notifications
You must be signed in to change notification settings - Fork 0
/
daily.c
183 lines (153 loc) · 4.44 KB
/
daily.c
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
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "daily.h"
/**
* 构造栈数据结构,用来进行树的遍历
*/
struct Stack {
TreeNode * data[1000];
int bottom;
int top;
};
typedef struct Stack Stack;
Stack * initStack() {
Stack * stack = (Stack *) malloc(sizeof(Stack));
stack->bottom = -1;
stack->top = -1;
return stack;
}
void freeStack(Stack * stack) {
free(stack);
}
int isEmpty(Stack * stack) {
return stack->bottom == stack->top;
}
void push(Stack * stack, TreeNode * node) {
stack->top++;
stack->data[stack->top] = node;
}
TreeNode * pop(Stack * stack) {
if (isEmpty(stack))
return NULL;
stack->top--;
return stack->data[stack->top + 1];
}
TreeNode * initTree() {
TreeNode * head = (TreeNode *) malloc(sizeof(TreeNode));
head->value = 0;
head->super = NULL;
head->left = NULL;
head->right = NULL;
return head;
}
TreeNode * addToTree(TreeNode * super, char value, int isLeft) {
TreeNode * newNode = (TreeNode *) malloc(sizeof(TreeNode));
newNode->value = value;
newNode->left = NULL;
newNode->right = NULL;
newNode->super = super;
if (isLeft)
super->left = newNode;
else
super->right = newNode;
return newNode;
}
int Depth(TreeNode * root) {
int m, n;
if (root == NULL)
return 0;
else {
m = Depth(root->left);
n = Depth(root->right);
return m > n ? m + 1 : n + 1;
}
}
void computeTree(TreeNode * root) {
// 叶子节点个数
int leafCount = 0;
// 栈数据结构
Stack * stack = initStack();
TreeNode * move = root;
while(1) {
if (move == NULL && isEmpty(stack))
break;
else if (move == NULL) {
TreeNode * parent = pop(stack);
move = parent->right;
} else if (move != NULL) {
push(stack, move);
if (move->left == NULL && move->right == NULL)
leafCount++;
move = move->left;
}
}
printf("%d\n", Depth(root));
printf("%d\n", leafCount);
freeStack(stack);
}
void freeTree(TreeNode * head) {
Stack * stack = initStack();
if (head != NULL) {
TreeNode * move = head;
// push(stack, move);
while(1) {
if (move == NULL && isEmpty(stack))
break;
else if (move == NULL) {
TreeNode * parent = pop(stack);
move = parent->right;
free(parent);
} else if (move != NULL) {
push(stack, move);
move = move->left;
}
}
}
}
void buildTree(TreeNode * head, Sequence * sequence) {
// 如果左子树和右子树都为NULL,那么递归结束
if (strlen(sequence->in) == 1)
return;
// 从中序遍历中找到该节点的左子树
long long index = strchr(sequence->in, head->value) - sequence->in;
// 左子树的中序遍历序列
char * leftIn = (char *) malloc(sizeof(char) * 1000);
int leftSize = (int)index;
strncpy(leftIn, sequence->in, leftSize);
leftIn[leftSize] = '\0';
// 左子树的先序遍历
char * leftPre = (char *) malloc(sizeof(char) * 1000);
strncpy(leftPre, sequence->pre + 1, leftSize);
leftPre[leftSize] = '\0';
if (strcmp(leftPre, "") != 0) {
// 从先序遍历中确定根节点
char leftValue = leftPre[0];
TreeNode * newLeftNode = addToTree(head, leftValue, 1);
// 将先序和中序封装为结构体
Sequence * leftSeq = (Sequence *) malloc(sizeof(Sequence));
leftSeq->pre = leftPre;
leftSeq->in = leftIn;
buildTree(newLeftNode, leftSeq);
}
// 右子树的中序遍历序列
char * rightIn = (char *) malloc(sizeof(char) * 1000);
int rightSize = (int)strlen(sequence->in) - leftSize;
strncpy(rightIn, sequence->in + index + 1, rightSize);
// 右子树的先序遍历
char * rightPre = (char *) malloc(sizeof(char) * 1000);
strncpy(rightPre, sequence->pre + 1 + leftSize, rightSize);
if (strcmp(rightPre, "") != 0) {
// 从先序遍历中找到根节点
char rightValue = rightPre[0];
TreeNode * newRightNode = addToTree(head, rightValue, 0);
// 将先序和中序封装为结构体
Sequence * rightSeq = (Sequence *) malloc(sizeof(Sequence));
rightSeq->pre = rightPre;
rightSeq->in = rightIn;
// 递归
buildTree(newRightNode, rightSeq);
}
if (rightPre == NULL && leftPre == NULL)
return;
}