blob: 55da560ef4e42ee56c391113940edb5c956add99 (
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
|
// Copyright 2018 Mimecast Ltd.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef BTREE_H
#define BTREE_H
#include "../defaults.h"
/**
* @brief This defines an element of the binary tree data structure
*/
typedef struct btreelem_ {
struct btreelem_ *left; /**< The next element to the left */
struct btreelem_ *right; /**< The next element to the right */
int key; /**< The key of the element */
void *data; /**< A pointer to the data stored in this element */
} btreelem_s;
/**
* @brief This defines a binary tree data structure.
*/
typedef struct btree_s_ {
btreelem_s *root; /**< The root element */
int size; /**< The current size of the binary tree */
} btree_s;
btree_s* btree_new();
void btree_destroy(btree_s *b);
void btree_destroy2(btree_s *b);
int btree_insert(btree_s *b, int key, void *data);
void* btree_get(btree_s *b, int key);
void btree_print(btree_s *b);
btreelem_s* btreelem_new(int key, void *data);
void btreelem_destroy_r(btreelem_s *e);
void btreelem_destroy_r2(btreelem_s *e);
int btreelem_insert_r(btreelem_s *e, int key, void *data);
void* btreelem_get_r(btreelem_s *e, int key);
void btreelem_print_r(btreelem_s *e, int depth);
#endif // BTREE_H
|
