#include <stdbool.h>
#include "generic_val.h"
#include "mem_manager.h"
Go to the source code of this file.
|
binarytree_t * | binarytree_new (size_t size, mem_alloc m_alloc) |
|
void | binarytree_del (binarytree_t **root, mem_free m_free) |
|
void * | binarytree_rootval (binarytree_t *tree) |
|
binarytree_t * | binarytree_leftsubtree (binarytree_t *tree) |
|
binarytree_t * | binarytree_rightsubtree (binarytree_t *tree) |
|
void | binarytree_set_leftsubtree (binarytree_t *tree, binarytree_t *subtree) |
|
void | binarytree_set_rightsubtree (binarytree_t *tree, binarytree_t *subtree) |
|
int | binarytree_count (binarytree_t *node) |
|
binarytree_t * | binarytree_list_to_tree (binarytree_t **head, int count) |
|
binarytree_t * | binarytree_listify (binarytree_t *root) |
|
binarytree_t * | binarytree_listalloc (size_t elt_size, int num_elts, mem_alloc m_alloc) |
|
binarytree_t * | binarytree_find (binarytree_t *tree, val_cmp fn, void *val) |
|
void | binarytree_tostring (binarytree_t *root, val_tostr valtostr_fun, char valstr[], char treestr[]) |
|
void | binarytree_tostring_indent (binarytree_t *tree, val_tostr tostr, char valstr[], char *indents, char treestr[]) |
|
int | binarytree_height (binarytree_t *tree) |
|
binarytree_t * | binarytree_insert (binarytree_t *tree, val_cmp compare, binarytree_t *key) |
|
◆ MAX_INDENTS
◆ MAX_TREE_STR
#define MAX_TREE_STR 65536 |
◆ OPAQUE_TYPE
◆ binarytree_t
◆ binarytree_count()
◆ binarytree_del()
◆ binarytree_find()
◆ binarytree_height()
◆ binarytree_insert()
◆ binarytree_leftsubtree()
◆ binarytree_list_to_tree()
◆ binarytree_listalloc()
◆ binarytree_listify()
◆ binarytree_new()
◆ binarytree_rightsubtree()
◆ binarytree_rootval()
◆ binarytree_set_leftsubtree()
◆ binarytree_set_rightsubtree()
◆ binarytree_tostring()
◆ binarytree_tostring_indent()
void binarytree_tostring_indent |
( |
binarytree_t * |
tree, |
|
|
val_tostr |
tostr, |
|
|
char |
valstr[], |
|
|
char * |
indents, |
|
|
char |
treestr[] |
|
) |
| |