blob: 306682986beeef334e0c841cbf11f9e30ade3ada (
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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "btree.h"
struct BTree_head * init_head(void)
{
struct BTree_head *head = malloc(sizeof(struct BTree_head));
if (head == NULL)
return NULL;
head->root = NULL;
head->height = 0;
head->order = 0;
head->num_recs = 0;
return head;
}
void destroy_head(struct BTree_head *head)
{
free(head);
}
struct BTree_node * new_node(void)
{
struct BTree_node *new = malloc(sizeof(struct BTree_node));
if (new != NULL)
memset(new, 0, sizeof(struct BTree_node));
return new;
}
void destroy_node(struct BTree_node *node)
{
if (node)
free(node);
}
int btree_add(struct Data *item)
{
return 0;
}
int btree_delete(void)
{
return 0;
}
int btree_search(void)
{
return 0;
}
int btree_dump(void)
{
return 0;
}
void usage(void)
{
return;
}
|
