integer_bistree.h

Aller à la documentation de ce fichier.

 
/*****************************************************************************
*                                                                            *
*  ------------------------------- bistree.h ------------------------------  *
*                                                                            *
*****************************************************************************/
 
#ifndef integer_BISTREE_H
#define integer_BISTREE_H
 
#include <stdbool.h>
#include "bitree.h"
 
/*****************************************************************************
*                                                                            *
*  Define balance factors for AVL trees.                                     *
*                                                                            *
*****************************************************************************/
 
#define integer_AVL_LFT_HEAVY         1
#define integer_AVL_BALANCED          0
#define integer_AVL_RGT_HEAVY        -1
 
/*****************************************************************************
*                                                                            *
*  Define a structure for nodes in AVL trees.                                *
*                                                                            *
*****************************************************************************/
 
typedef struct integer_avlnode_t {
  int data; 
  int hidden; 
  int factor; 
} integer_avlnode_t;
 
/*****************************************************************************
*                                                                            *
*  Implement binary search trees as binary trees.                            *
*                                                                            *
*****************************************************************************/
 
typedef generic_bitree_t integer_bistree_t;
 
/*****************************************************************************
*                                                                            *
*  --------------------------- Public Interface ---------------------------  *
*                                                                            *
*****************************************************************************/
 
void integer_bistree_init(integer_bistree_t *tree);
 
void integer_bistree_destroy(integer_bistree_t *tree);
 
int integer_bistree_insert(integer_bistree_t *tree, int data);
 
int integer_bistree_remove(integer_bistree_t *tree, int data);
 
bool integer_bistree_lookup(integer_bistree_t *tree, int data);
 
int integer_bistree_size(integer_bistree_t *tree);
 
#endif