-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary_trees.h
95 lines (70 loc) · 2.23 KB
/
binary_trees.h
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
#ifndef _BINARY_TREES_H_
#define _BINARY_TREES_H_
#include <stdlib.h>
#include <stddef.h>
/**
* struct binary_tree_s - Binary tree node
*
* @n: Integer stored in the node
* @parent: Pointer to the parent node
* @left: Pointer to the left child node
* @right: Pointer to the right child node
*/
struct binary_tree_s
{
int n;
struct binary_tree_s *parent;
struct binary_tree_s *left;
struct binary_tree_s *right;
};
typedef struct binary_tree_s binary_tree_t;
/* The binary tree print function */
/*
* static int print_t(const binary_tree_t *tree,
* int offset, int depth, char **s);
static size_t _height(const binary_tree_t *tree);
void binary_tree_print(const binary_tree_t *tree);
*/
void binary_tree_print(const binary_tree_t *);
/* Task #0 */
binary_tree_t *binary_tree_node(binary_tree_t *parent, int value);
/* Task #1 */
binary_tree_t *binary_tree_insert_left(binary_tree_t *parent, int value);
/* Task #2 */
binary_tree_t *binary_tree_insert_right(binary_tree_t *parent, int value);
/* Task #3 */
void binary_tree_delete(binary_tree_t *tree);
/* Task #4 */
int binary_tree_is_leaf(const binary_tree_t *node);
/* Task #5 */
int binary_tree_is_root(const binary_tree_t *node);
/* Task #6 */
void binary_tree_preorder(const binary_tree_t *tree, void (*func)(int));
/* Task #7 */
void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int));
/* Task #8 */
void binary_tree_postorder(const binary_tree_t *tree, void (*func)(int));
/* Task #9 */
size_t binary_tree_height(const binary_tree_t *tree);
/* Task #10 */
size_t binary_tree_depth(const binary_tree_t *tree);
/* Task #11 */
size_t binary_tree_size(const binary_tree_t *tree);
/* Task #12 */
size_t binary_tree_leaves(const binary_tree_t *tree);
/* Task #13 */
size_t binary_tree_nodes(const binary_tree_t *tree);
/* Task #14 */
int binary_tree_balance(const binary_tree_t *tree);
/* Task #15 */
int binary_tree_is_full(const binary_tree_t *tree);
/* Task #16 */
int binary_tree_is_perfect(const binary_tree_t *tree);
/* Task #17 */
binary_tree_t *binary_tree_sibling(binary_tree_t *node);
/* Task #18 */
binary_tree_t *binary_tree_uncle(binary_tree_t *node);
/* Task #100 */
binary_tree_t *binary_trees_ancestor(const binary_tree_t *first,
const binary_tree_t *second);
#endif