avl.h File Reference

Adelson-Velsky and Landis self-balancing binary search tree. More...

#include "a.h"

Include dependency graph for avl.h:

Go to the source code of this file.

Data Structures
struct	a_avl_node
	instance structure for AVL binary search tree node More...
union	a_avl
	instance structure for AVL binary search tree root More...

Macros
#define	A_AVL_ROOT   {A_NULL}
#define	a_avl_entry(ptr, type, member)
	access the struct for this entry
#define	a_avl_foreach(cur, root)
	iterate over a AVL binary search tree in-order
#define	a_avl_foreach_reverse(cur, root)
	iterate over a AVL binary search tree in-order reverse
#define	a_avl_pre_foreach(cur, root)
	iterate over a AVL binary search tree preorder
#define	a_avl_pre_foreach_reverse(cur, root)
	iterate over a AVL binary search tree preorder reverse
#define	a_avl_post_foreach(cur, root)
	iterate over a AVL binary search tree postorder
#define	a_avl_post_foreach_reverse(cur, root)
	iterate over a AVL binary search tree postorder reverse
#define	a_avl_fortear(cur, next, root)
	tear a AVL binary search tree using postorder traversal

Typedefs
typedef struct a_avl_node	a_avl_node
	instance structure for AVL binary search tree node
typedef union a_avl	a_avl
	instance structure for AVL binary search tree root

Functions
a_avl_node *	a_avl_parent (a_avl_node const *node)
	access parent of AVL binary search tree node
a_avl_node *	a_avl_init (a_avl_node *node, a_avl_node *parent)
	initialize for AVL binary search tree node
void	a_avl_root (a_avl *root)
	initialize for AVL binary search tree root
a_avl_node *	a_avl_head (a_avl const *root)
	access head node of AVL binary search tree in-order
a_avl_node *	a_avl_tail (a_avl const *root)
	access tail node of AVL binary search tree in-order
a_avl_node *	a_avl_next (a_avl_node *node)
	access next node of AVL binary search tree node in-order
a_avl_node *	a_avl_prev (a_avl_node *node)
	access prev node of AVL binary search tree node in-order
a_avl_node *	a_avl_pre_next (a_avl_node *node)
	access next node of AVL binary search tree node preorder
a_avl_node *	a_avl_pre_prev (a_avl_node *node)
	access prev node of AVL binary search tree node preorder
a_avl_node *	a_avl_post_head (a_avl const *root)
	access head node of AVL binary search tree postorder
a_avl_node *	a_avl_post_tail (a_avl const *root)
	access tail node of AVL binary search tree postorder
a_avl_node *	a_avl_post_next (a_avl_node *node)
	access next node of AVL binary search tree node postorder
a_avl_node *	a_avl_post_prev (a_avl_node *node)
	access prev node of AVL binary search tree node postorder
a_avl_node *	a_avl_tear (a_avl *root, a_avl_node **next)
	tear a node from AVL binary search tree
a_avl_node *	a_avl_search (a_avl const *root, void const *ctx, int(*cmp)(void const *, void const *))
	search specified content from AVL binary search tree
a_avl_node *	a_avl_insert (a_avl *root, a_avl_node *node, int(*cmp)(void const *, void const *))
	insert specified node into AVL binary search tree
void	a_avl_insert_adjust (a_avl *root, a_avl_node *node)
	rebalance the tree after insertion of the specified node
void	a_avl_remove (a_avl *root, a_avl_node *node)
	remove specified node from AVL binary search tree

Detailed Description

Adelson-Velsky and Landis self-balancing binary search tree.