blob: a7b960de390543908f2fed3b105553898fec7493 (
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
|
#include "btree.h"
#include <stdio.h>
#include <stdlib.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_initialize(int data) {
BTree *tree = malloc(sizeof(BTree));
tree->left = NULL;
tree->right = NULL;
tree->data = data;
return tree;
}
BTree *btree_insert(BTree *tree, int data) {
if (!tree)
return btree_initialize(data);
if (data <= tree->data)
if (tree->left)
btree_insert(tree->left, data);
else
tree->left = btree_initialize(data);
else if (tree->right)
btree_insert(tree->right, data);
else
tree->right = btree_initialize(data);
return tree;
}
int btree_height(BTree *tree) {
if (tree == NULL)
return 0;
int left = btree_height(tree->left);
int right = btree_height(tree->right);
return (left > right) ? left + 1 : right + 1;
}
void btree_inspect(BTree *tree) { inspect(tree, 0); }
int btree_leaves(BTree *tree) {
if (tree == NULL)
return 0;
if (tree->left == NULL && tree->right == NULL)
return 1;
return btree_leaves(tree->left) + btree_leaves(tree->right);
}
BTree *btree_generate(int leaves) {
BTree *tree = NULL;
while (btree_leaves(tree) < leaves)
tree = btree_insert(tree, rand());
return tree;
}
|
