#include <defines.h>
Data Fields | |
char * | name |
char * | value |
tnode * | left |
tnode * | right |
tnode * | up |
Node for a tree that carries two strings: a key and a value. The tree is a binary tree that is sorted by key.
Pointer to left child node
Referenced by tree_add(), tree_dealloc(), tree_find(), and tree_remove().
char* tnode_s::name |
Key value for tree node
Referenced by tree_add(), tree_dealloc(), tree_find(), and tree_remove().
Pointer to right child node
Referenced by tree_add(), tree_dealloc(), tree_find(), and tree_remove().
Pointer to parent node
Referenced by tree_add(), and tree_remove().
char* tnode_s::value |
Value of node
Referenced by obfuscate_name(), tree_add(), tree_dealloc(), and tree_remove().