Data Structures & Algorithms in C++
Goodrich, Tamassia, Mount and Goldwasser
Loading...
Searching...
No Matches
Public Member Functions | Friends
dsac::tree::LinkedBinaryTree< E >::Position Class Reference

#include <linked_binary_tree.h>

Collaboration diagram for dsac::tree::LinkedBinaryTree< E >::Position:
Collaboration graph

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< Positionchildren () const
 
int num_children () const
 

Friends

class LinkedBinaryTree
 

Constructor & Destructor Documentation

◆ Position()

template<typename E >
dsac::tree::LinkedBinaryTree< E >::Position::Position ( Node nd = nullptr)
inline

Member Function Documentation

◆ children()

template<typename E >
std::vector< Position > dsac::tree::LinkedBinaryTree< E >::Position::children ( ) const
inline

◆ element() [1/2]

template<typename E >
E & dsac::tree::LinkedBinaryTree< E >::Position::element ( )
inline

◆ element() [2/2]

template<typename E >
const E & dsac::tree::LinkedBinaryTree< E >::Position::element ( ) const
inline

◆ is_external()

template<typename E >
bool dsac::tree::LinkedBinaryTree< E >::Position::is_external ( ) const
inline

◆ is_null()

template<typename E >
bool dsac::tree::LinkedBinaryTree< E >::Position::is_null ( ) const
inline

◆ is_root()

template<typename E >
bool dsac::tree::LinkedBinaryTree< E >::Position::is_root ( ) const
inline

◆ left()

template<typename E >
Position dsac::tree::LinkedBinaryTree< E >::Position::left ( ) const
inline

◆ num_children()

template<typename E >
int dsac::tree::LinkedBinaryTree< E >::Position::num_children ( ) const
inline

◆ operator!=()

template<typename E >
bool dsac::tree::LinkedBinaryTree< E >::Position::operator!= ( Position  other) const
inline

◆ operator==()

template<typename E >
bool dsac::tree::LinkedBinaryTree< E >::Position::operator== ( Position  other) const
inline

◆ parent()

template<typename E >
Position dsac::tree::LinkedBinaryTree< E >::Position::parent ( ) const
inline

◆ right()

template<typename E >
Position dsac::tree::LinkedBinaryTree< E >::Position::right ( ) const
inline

Friends And Related Symbol Documentation

◆ LinkedBinaryTree

template<typename E >
friend class LinkedBinaryTree
friend

The documentation for this class was generated from the following file: