a_rbt_node Struct Reference

instance structure for red–black binary search tree node More...

#include <rbt.h>

Collaboration diagram for a_rbt_node:

Data Fields
struct a_rbt_node *	left
struct a_rbt_node *	right
uintptr_t	parent_

Detailed Description

instance structure for red–black binary search tree node

Field Documentation

left

struct a_rbt_node* a_rbt_node::left

pointer to left child or null

parent_

uintptr_t a_rbt_node::parent_

pointer to parent combined with the color. The mapping is: 0 => red, 1 => black. The rest of the bits are the pointer to the parent node. It must be 2-byte aligned, and it will be null if this is the root node and therefore has no parent.

right

struct a_rbt_node* a_rbt_node::right

pointer to right child or null

---

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

• rbt.h