|
using | DataType = T |
|
using | Node = uint32_t |
|
using | NodeQueue = std::deque<Node> |
|
|
Node | Parent (Node node) const |
|
Node | FirstChild (Node node) const |
|
Node | NextSibling (Node node) const |
|
Node | LeftMost (Node node) const |
|
uint32_t | Depth (Node node) const |
|
Node | Insert (const DataType &data, Node parent) |
|
void | Erase (Node node) |
|
DataType & | operator[] (Node node) |
|
const DataType & | operator[] (Node node) const |
|
template<typename V , typename O > |
void | Traverse (V &visitor) |
|
|
class | BreadthFirst |
|
class | PreOrder |
|
class | InOrder |
|
class | PostOrder |
|
The documentation for this class was generated from the following file: