template <class Entry>
void Binary_tree<Entry> :: recursive_inorder (
Binary_node<Entry> *sub_root, void ( *visit )( Entry & ))
/* Pre: sub root is either NULL or points to a subtree of the Binary tree.
Post: The subtree has been traversed in inorder sequence.
Uses: The function recursive_inorder recursively */
{
if ( sub_root != NULL ) {
recursive_inorder ( sub_root->left, visit );
( *visit ) ( sub_root->data );
recursive_inorder ( sub_root->right, visit );
}
}
那位高手能告诉我第二个形参是什么东西,还有 ( *visit ) ( sub_root->data );
这行。