Data Structures & Algorithms in C++
Goodrich, Tamassia, Mount and Goldwasser
|
#include <linked_binary_tree.h>
Public Member Functions | |
Position (Node *nd=nullptr) | |
bool | operator== (Position other) const |
bool | operator!= (Position other) const |
bool | is_null () const |
bool | is_root () const |
bool | is_external () const |
E & | element () |
const E & | element () const |
Position | parent () const |
Position | left () const |
Position | right () const |
std::vector< Position > | children () const |
int | num_children () const |
Friends | |
class | LinkedBinaryTree |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |