Data Structures UFC  1.0.0
Essential Data Structures for C language
Typedefs | Functions
bst.h File Reference

Go to the source code of this file.

Typedefs

typedef struct BinaryNode BSTree
 

Functions

BSTreebst_create_node (BSTree *left, BSTree *right, Type value)
 
BSTreebst_create (void)
 
int bst_empty (BSTree *t)
 
int bst_exists (BSTree *t, Type c)
 
BSTreebst_search (BSTree *t, Type c)
 
void bst_print (BSTree *t)
 
int bst_height (BSTree *t)
 
BSTreebst_insert (BSTree *t, Type c)
 
BSTreebst_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 Documentation

typedef struct BinaryNode BSTree

This module define a Abstract Data Type for the structure Binary Search Tree.

Function Documentation

BSTree* bst_create ( void  )
BSTree* bst_create_node ( BSTree left,
BSTree right,
Type  value 
)
int bst_empty ( BSTree t)
int bst_equals ( BSTree t1,
BSTree t2 
)
int bst_exists ( BSTree t,
Type  c 
)
void bst_free ( BSTree t)
int bst_height ( BSTree t)
void bst_infix ( BSTree t)
BSTree* bst_insert ( BSTree t,
Type  c 
)
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)
BSTree* bst_remove ( BSTree t,
Type  c 
)
BSTree* bst_search ( BSTree t,
Type  c 
)
int bst_two_children ( BSTree t)