#include <eg_ebtree.h>
Collaboration diagram for EGeBTree_t:

Definition at line 59 of file eg_ebtree.h.
Data Fields | |
| EGeBTree_t * | cn [3] |
|
|
This array contains three pointers, in position EG_EBTREE_PARENT the link to the parent of this node, in position EG_EBTREE_LEFT the link to the left child, and in EG_EBTREE_RIGHT the link to the right child for this node. If any of this pointers is NULL, then the link does not exists. In particular a leaf is a node with both child links set to NULL, and the root of a tree is the node whose parent link is NULL. Definition at line 61 of file eg_ebtree.h. |
1.4.5