Data Structures Lerax 1.0.0
Essential Data Structures for C language
Loading...
Searching...
No Matches
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

◆ BSTree

typedef struct BinaryNode BSTree

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

Function Documentation

◆ bst_create()

BSTree * bst_create ( void )

◆ bst_create_node()

BSTree * bst_create_node ( BSTree * left,
BSTree * right,
Type value )

◆ bst_empty()

int bst_empty ( BSTree * t)

◆ bst_equals()

int bst_equals ( BSTree * t1,
BSTree * t2 )

◆ bst_exists()

int bst_exists ( BSTree * t,
Type c )

◆ bst_free()

void bst_free ( BSTree * t)

◆ bst_height()

int bst_height ( BSTree * t)

◆ bst_infix()

void bst_infix ( BSTree * t)

◆ bst_insert()

BSTree * bst_insert ( BSTree * t,
Type c )

◆ bst_leafs_primes()

int bst_leafs_primes ( BSTree * t)

◆ bst_nodes()

int bst_nodes ( BSTree * t)

◆ bst_nodes_equal_height()

int bst_nodes_equal_height ( BSTree * t)

◆ bst_posfix()

void bst_posfix ( BSTree * t)

◆ bst_prefix()

void bst_prefix ( BSTree * t)

◆ bst_print()

void bst_print ( BSTree * t)

◆ bst_remove()

BSTree * bst_remove ( BSTree * t,
Type c )

◆ bst_search()

BSTree * bst_search ( BSTree * t,
Type c )

◆ bst_two_children()

int bst_two_children ( BSTree * t)