Data Structures & Algorithms in C++
Goodrich, Tamassia, Mount and Goldwasser
|
#include <linked_binary_tree.h>
Public Member Functions | |
Node (E e, Node *p=nullptr) | |
Data Fields | |
E | element |
Node * | parent |
Node * | left {nullptr} |
Node * | right {nullptr} |
|
inline |
E dsac::tree::LinkedBinaryTree< E >::Node::element |
Node* dsac::tree::LinkedBinaryTree< E >::Node::left {nullptr} |
Node* dsac::tree::LinkedBinaryTree< E >::Node::parent |
Node* dsac::tree::LinkedBinaryTree< E >::Node::right {nullptr} |