Pat*_*ity 4 c++ tree traversal
我目前正在用c ++实现二叉树,我想用一个名为in_order()的函数遍历它.
是否有任何方法可以将函数作为参数传递,这样我就可以执行以下操作(无需编写代码来遍历列表多次)?
struct tree_node; // and so on
class tree; // and so on
void print_node () {
// some stuff here
}
// some other functions
tree mytree();
// insert some nodes
mytree.in_order(print_node);
mytree.in_order(push_node_to_stack);
mytree.in_order(something_else);
Run Code Online (Sandbox Code Playgroud)
CB *_*ley 14
是的,你可以通过多种方式实现这一目标.这有两种常见的可能性.
旧式函数指针
class mytree
{
// typedef for a function pointer to act
typedef void (*node_fn_ptr)(tree_node&);
void in_order(node_fn_ptr)
{
tree_node* pNode;
while (/* ... */)
{
// traverse...
// ... lots of code
// found node!
(*fnptr)(*pNode);
// equivalently: fnptr(*pNode)
}
}
};
void MyFunc(tree_node& tn)
{
// ...
}
void sample(mytree& tree)
{
// called with a default constructed function:
tree.inorder(&MyFunc);
// equivalently: tree.inorder(MyFunc);
}
Run Code Online (Sandbox Code Playgroud)
使用仿函数
使用模板成员,使用函数指针
class mytree
{
// typedef for a function pointer to act
typedef void (*node_fn_ptr)(tree_node&);
template<class F>
void in_order(F f)
{
tree_node* pNode;
while (/* ... */)
{
// traverse...
// ... lots of code
// found node!
f(*pNode);
}
}
};
struct ExampleFunctor
{
void operator()(tree_node& node)
{
// do something with node
}
}
void sample(mytree& tree)
{
// called with a default constructed function:
tree.inorder(ExampleFunctor());
}
Run Code Online (Sandbox Code Playgroud)