Defines node type lrptree_node_t which can be stored in trees which need left, right, and parent pointers (see redblacktree_t).
LRPTree-Node | Defines node type lrptree_node_t which can be stored in trees which need left, right, and parent pointers (see redblacktree_t). |
Copyright | This program is free software. |
Files | |
C-kern/ | Header file LRPTree-Node. |
Types | |
struct lrptree_node_t | Export lrptree_node_t into global namespace. |
lrptree_node_t | Management overhead of objects which wants to be stored in a redblacktree_t. |
left | Points to left subtree. |
right | Points to right subtree. |
parent | Points to parent node. |
lifetime | |
lrptree_node_INIT | Static initializer. |
This program is free software. You can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
© 2012 Jörg Seebohn
Header file LRPTree-Node.
typedef struct lrptree_node_t lrptree_node_t
Export lrptree_node_t into global namespace.
struct lrptree_node_t
Management overhead of objects which wants to be stored in a redblacktree_t. A node of type lrptree_node_t can be stored in binary tree structures which needs a pointer to left and right childs and to the parent node.
left╭──────╮right ╭───┤ node ├──╮ │ ╰∆────∆╯ │ ╭───∇───╮│ │╭──∇────╮ │ left ├╯ ╰┤ right │ │ child │parent│ child │ ╰┬─────┬╯ ╰┬─────┬╯ left right left right
left | Points to left subtree. |
right | Points to right subtree. |
parent | Points to parent node. |
lifetime | |
lrptree_node_INIT | Static initializer. |
Management overhead of objects which wants to be stored in a redblacktree_t.
struct lrptree_node_t
Export lrptree_node_t into global namespace.
typedef struct lrptree_node_t lrptree_node_t
Points to left subtree.
lrptree_node_t * left
Points to right subtree.
lrptree_node_t * right
Points to parent node.
lrptree_node_t * parent
Static initializer.
#define lrptree_node_INIT { 0, 0, 0 }