Data Structures UFC
1.0.0
Essential Data Structures for C language
|
Go to the source code of this file.
Typedefs | |
typedef struct BinaryNode | BSTree |
Functions | |
BSTree * | bst_create_node (BSTree *left, BSTree *right, Type value) |
BSTree * | bst_create (void) |
int | bst_empty (BSTree *t) |
int | bst_exists (BSTree *t, Type c) |
BSTree * | bst_search (BSTree *t, Type c) |
void | bst_print (BSTree *t) |
int | bst_height (BSTree *t) |
BSTree * | bst_insert (BSTree *t, Type c) |
BSTree * | bst_remove (BSTree *t, Type c) |
void | bst_free (BSTree *t) |
void | bst_posfix (BSTree *t) |
void | bst_prefix (BSTree *t) |
void | bst_infix (BSTree *t) |
int | bst_nodes (BSTree *t) |
int | bst_leafs_primes (BSTree *t) |
int | bst_two_children (BSTree *t) |
int | bst_nodes_equal_height (BSTree *t) |
int | bst_equals (BSTree *t1, BSTree *t2) |
typedef struct BinaryNode BSTree |
This module define a Abstract Data Type for the structure Binary Search Tree.
BSTree* bst_create | ( | void | ) |
int bst_empty | ( | BSTree * | t | ) |
int bst_exists | ( | BSTree * | t, |
Type | c | ||
) |
void bst_free | ( | BSTree * | t | ) |
int bst_height | ( | BSTree * | t | ) |
void bst_infix | ( | BSTree * | t | ) |
int bst_leafs_primes | ( | BSTree * | t | ) |
int bst_nodes | ( | BSTree * | t | ) |
int bst_nodes_equal_height | ( | BSTree * | t | ) |
void bst_posfix | ( | BSTree * | t | ) |
void bst_prefix | ( | BSTree * | t | ) |
void bst_print | ( | BSTree * | t | ) |
int bst_two_children | ( | BSTree * | t | ) |