Data Structures Lerax 1.0.0
Essential Data Structures for C language
|
Go to the source code of this file.
Typedefs | |
typedef struct BinaryNode | AVLTree |
Functions | |
AVLTree * | avl_create_node (Type value) |
AVLTree * | avl_create (void) |
int | avl_empty (AVLTree *t) |
int | avl_exists (AVLTree *t, Type c) |
AVLTree * | avl_search (AVLTree *t, Type c) |
void | avl_print (AVLTree *t) |
int | avl_height (AVLTree *t) |
AVLTree * | avl_insert (AVLTree *t, Type c) |
AVLTree * | avl_remove (AVLTree *t, Type c) |
void | avl_free (AVLTree *t) |
void | avl_posfix (AVLTree *t) |
void | avl_prefix (AVLTree *t) |
void | avl_infix (AVLTree *t) |
int | avl_nodes (AVLTree *t) |
int | avl_leafs_primes (AVLTree *t) |
int | avl_two_children (AVLTree *t) |
int | avl_nodes_equal_height (AVLTree *t) |
int | avl_equals (AVLTree *t1, AVLTree *t2) |
typedef struct BinaryNode AVLTree |
@description This module define a Abstract Data Type for the structure Binary Search Tree.
AVLTree * avl_create | ( | void | ) |
AVLTree * avl_create_node | ( | Type | value | ) |
int avl_empty | ( | AVLTree * | t | ) |
int avl_exists | ( | AVLTree * | t, |
Type | c ) |
void avl_free | ( | AVLTree * | t | ) |
int avl_height | ( | AVLTree * | t | ) |
void avl_infix | ( | AVLTree * | t | ) |
int avl_leafs_primes | ( | AVLTree * | t | ) |
int avl_nodes | ( | AVLTree * | t | ) |
int avl_nodes_equal_height | ( | AVLTree * | t | ) |
void avl_posfix | ( | AVLTree * | t | ) |
void avl_prefix | ( | AVLTree * | t | ) |
void avl_print | ( | AVLTree * | t | ) |
int avl_two_children | ( | AVLTree * | t | ) |