|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Basic binary tree node definitions. More...
#include <iostream>#include <stdexcept>#include <type_traits>#include <utility>#include <ahDefs.H>#include <ahAssert.H>#include <ah-errors.H>Go to the source code of this file.
Classes | |
| struct | Aleph::Empty_Node |
| struct | Aleph::node_traits< Node > |
| class | Aleph::BinNode< Key > |
| Node for binary search tree. More... | |
| class | Aleph::BinNodeVtl< Key > |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Macros | |
| #define | INIT_CLASS_BINNODE(Name, height, Control_Data) |
| #define | DECLARE_BINNODE(Name, height, Control_Data) |
| Specify tree node for a binary tree. | |
| #define | DECLARE_BINNODE_SENTINEL(Name, height, Control_Data) |
| Specify tree node for a binary tree. | |
Functions | |
| template<class Node > | |
| constexpr Node *& | Aleph::LLINK (Node *p) noexcept |
| Return a pointer to left subtree. | |
| template<class Node > | |
| constexpr const Node * | Aleph::LLINK (const Node *p) noexcept |
| template<class Node > | |
| constexpr Node *& | Aleph::RLINK (Node *p) noexcept |
| Return the right tree of p. | |
| template<class Node > | |
| constexpr const Node * | Aleph::RLINK (const Node *p) noexcept |
| template<class Node > | |
| constexpr Node::Key_Type & | Aleph::KEY (Node *p) noexcept |
| Return a modifiable reference to the key stored in the node. | |
| template<class Node > | |
| constexpr const Node::Key_Type & | Aleph::KEY (const Node *p) noexcept |
Basic binary tree node definitions.
This file provides the fundamental binary tree node templates including BinNode (basic node) and BinNodeVtl (node with virtual destructor). These serve as building blocks for all binary tree implementations.
Definition in file tpl_binNode.H.
| #define INIT_CLASS_BINNODE | ( | Name, | |
| height, | |||
| Control_Data | |||
| ) |
Definition at line 152 of file tpl_binNode.H.