For internal use only.
This file contains the implementation of the rt_remove() function, used to remove a node from a red-black tree.
Definition in file rt_remove.c.
#include "dbprim.h"
#include "dbprim_int.h"
Include dependency graph for rt_remove.c:

Go to the source code of this file.
Defines | |
| #define | _rn_clear(node) |
| Clear a node. | |
| #define | _rt_update_parent(tree, node, new) |
| Update a node's parent. | |
| #define | isleft(par, n) |
| Determine if node is a left child of its parent. | |
| #define | sel_lr(t, n) |
| Select a child node based on a condition. | |
| #define | sibling(par, n) |
| Locate the sibling of a node. | |
| #define | l_neph(par, n) |
| Locate "closer" nephew of a node. | |
| #define | r_neph(par, n) |
| Locate "further" nephew of a node. | |
Functions | |
| unsigned long | rt_remove (rb_tree_t *tree, rb_node_t *node) |
| Remove a node from a red-black tree. | |
1.4.4