blob: 3fd4e316467a13da04ef9e2ed3ad7f939ad0061c (
plain)
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
|
#include "btree.h"
#include "stack.h"
#include <stdio.h>
static void inspect(BTree *tree, int level) {
if (!tree)
return;
for (int i = 0; i < level; i++)
printf(" ");
printf("%2d\n", tree->data);
inspect(tree->left, level + 1);
inspect(tree->right, level + 1);
}
BTree *btree_init(int data) {
BTree *tree = malloc(sizeof(BTree));
tree->left = NULL;
tree->right = NULL;
tree->data = data;
return tree;
}
void btree_pre_order_number(BTree *tree) {
Stack *stack = stack_init();
/*stack_push(stack, tree);*/
//use a stack
//self
//left
//right
}
void btree_in_order_number(BTree *root) {
BTree *original = root;
if (root == NULL) return;
Stack *stack = stack_init();
int i = 0;
while (true) {
if (root) {
stack_push(stack, root);
root = root->left;
}
else {
if (stack_size(stack) == 0)
break;
root = stack_pop(stack);
original->in_order[i] = root->data;
++i;
root = root->right;
}
}
}
void btree_post_order_number(BTree *tree) {
// left
// right
// self
}
BTree *btree_insert(BTree *tree, int data) {
if (!tree)
return btree_init(data);
if (data <= tree->data)
if (tree->left)
btree_insert(tree->left, data);
else
tree->left = btree_init(data);
else
if (tree->right)
btree_insert(tree->right, data);
else
tree->right = btree_init(data);
return tree;
}
void btree_inspect(BTree *tree) { inspect(tree, 0); }
|
