A single node of an AVL tree. More...

#include <avl.h>

Data Fields
avl_t *	left
	The left child.

avl_t *	right
	The right child.

avl_t *	parent
	The parent, NULL if this is the root.

ssize_t	height
	Height of the tree.

Detailed Description

A complete tree is formed of multiple single nodes linked between them.

We do not have a struct for the whole tree, as it can simply be addressed using its root node. Keep in mind that, in this implementation, when referring to a "tree" we're instead referring to "the tree that starts at the given node" (i.e. the node and its children).

The documentation for this struct was generated from the following file:

lib/libalgo/include/libalgo/avl.h

Data Fields

Detailed Description