bitree.h

Go to the documentation of this file.

/*
 *       _____
 * ANSI / ___/
 *     / /__  
 *     \___/  
 *
 * Filename: bitree.h
 * Author  : Kyle Loudon/Dan Levin
 * Date    : Fri Mar 22 12:40:45 GMT 2013
 * Version : 0.51
 * ---
 * Description: A basic, binary search tree ADT - written in ANSI C.
 * 
 * Date   Revision message
 * 130217 Created this file
 * 150331 This code ready for version 0.51
 *
 */
#ifndef _BITREE_H_
#define _BITREE_H_

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <malloc.h>
#include <assert.h>

#include "utils.h"

#ifdef __cplusplus
extern "C" {
#endif

  typedef struct BiTreeNode_ *BiTreeNode;

  typedef struct BiTree_ *BiTree;

  /* FUNCTION DECLARATIONS */

  BiTree BITREEinit(void (*destroy)(void *data));

  void BITREEdestroy(BiTree tree);

  void BITREEsetcompare(BiTree tree, int (*compare)(const void *key1, const void *key2));

  int BITREEinsleft(BiTree tree, BiTreeNode node, const void *data);

  int BITREEinsright(BiTree tree, BiTreeNode node, const void *data);

  int BITREEinsert(BiTree tree, const void *data);

  int BITREElookup(BiTree tree, void **data);

  int BITREEremove(BiTree tree, void **data);

  void BITREEremleft(BiTree tree, BiTreeNode node);

  void BITREEremright(BiTree tree, BiTreeNode node);

  BiTree BITREEmerge(BiTree left, BiTree right, const void *data);

  int BITREEsize(BiTree tree);

  BiTreeNode BITREEroot(BiTree tree);

  int BITREEis_eob(BiTreeNode node);

  int BITREEis_leaf(BiTreeNode node);

  void *BITREEdata(BiTreeNode node);

  BiTreeNode BITREEleft(BiTreeNode node);

  BiTreeNode BITREEright(BiTreeNode node);

  int BITREEheight(BiTree tree);

  void BITREEprint(BiTree tree, void (*callback)(const void *data));

  void BITREEpreorder(BiTree tree, void (*callback)(const void *data));

  void BITREEinorder(BiTree tree, void (*callback)(const void *data));

  void BITREEpostorder(BiTree tree, void (*callback)(const void *data));

#ifdef __cplusplus
}
#endif 

#endif /* _BITREE_H_ */