|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Generic inorder traversal of a binary tree. More...
#include <tpl_binNodeUtils.H>
Public Member Functions | |
| template<class Op > | |
| void | traverse (Node *root, Op &&op) const |
| Invoke to traversal from root node. | |
| template<class Op > | |
| void | operator() (Node *root, Op &op) const |
| template<class Op > | |
| void | operator() (Node *root, Op &&op) const |
Static Private Member Functions | |
| template<class Op > | |
| static void | for_each_inorder (Node *root, Op &&op) |
Generic inorder traversal of a binary tree.
For_Each_In_Order traverses a binary tree in order. For each is node is called an operation with the following signature:
struct Op { void operator () (Node * p) { operation } };
Definition at line 212 of file tpl_binNodeUtils.H.
|
inlinestaticprivate |
Definition at line 215 of file tpl_binNodeUtils.H.
References Aleph::For_Each_In_Order< Node >::for_each_inorder(), Aleph::LLINK(), Aleph::RLINK(), and root().
Referenced by Aleph::For_Each_In_Order< Node >::for_each_inorder(), Aleph::For_Each_In_Order< Node >::operator()(), Aleph::For_Each_In_Order< Node >::operator()(), and Aleph::For_Each_In_Order< Node >::traverse().
|
inline |
Definition at line 242 of file tpl_binNodeUtils.H.
References Aleph::For_Each_In_Order< Node >::for_each_inorder(), and root().
|
inline |
Definition at line 235 of file tpl_binNodeUtils.H.
References Aleph::For_Each_In_Order< Node >::for_each_inorder(), and root().
|
inline |
Invoke to traversal from root node.
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
Definition at line 228 of file tpl_binNodeUtils.H.
References Aleph::For_Each_In_Order< Node >::for_each_inorder(), and root().