|
C Container Collection (CCC)
|
#include <private_tree_map.h>

A WAVL node follows traditional balanced binary tree constructs except for the rank field which can be simplified to an even/odd parity.
Data Fields | |
| struct CCC_Tree_map_node * | branch [2] |
| struct CCC_Tree_map_node * | parent |
| uint8_t | parity |
| struct CCC_Tree_map_node* CCC_Tree_map_node::branch[2] |
Children in an array to unite left and right cases.
| struct CCC_Tree_map_node* CCC_Tree_map_node::parent |
The parent node needed for iteration and rotation.
| uint8_t CCC_Tree_map_node::parity |
The rank parity of a node 1(odd) or 0(even).