pj_rbtree Struct Reference [Red/Black Balanced Tree]

Data Fields
pj_rbtree_node	null_node
pj_rbtree_node *	null
pj_rbtree_node *	root
unsigned	size
pj_rbtree_comp *	comp

---

Detailed Description

Declaration of a red-black tree. All elements in the tree must have UNIQUE key. A red black tree always maintains the balance of the tree, so that the tree height will not be greater than lg(N). Insert, search, and delete operation will take lg(N) on the worst case. But for insert and delete, there is additional time needed to maintain the balance of the tree.

---

Field Documentation

pj_rbtree_comp* pj_rbtree::comp

Key comparison function.

pj_rbtree_node* pj_rbtree::null

Constant to indicate NULL node.

pj_rbtree_node pj_rbtree::null_node

Constant to indicate NULL node.

pj_rbtree_node* pj_rbtree::root

Root tree node.

unsigned pj_rbtree::size

Number of elements in the tree.

---

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

• rbtree.h