text cover

Data Abstraction and Problem Solving with C++

Walls and Mirrors

by Frank M. Carrano

 Addison Wesley Logo

c10p535.cpp

Go to the documentation of this file.
00001 
00014 void BinaryTree::inorder(TreeNode *treePtr,
00015                          FunctionType visit)
00016 {  if (treePtr != NULL)
00017    {  inorder(treePtr->leftChildPtr, visit); // Point 1
00018       visit(treePtr->item);
00019       inorder(treePtr->rightChildPtr, visit); // Point 2
00020    }  // end if
00021 }  // end inorder
Generated on Sun Aug 27 21:28:56 2006 for AWLogo by  doxygen 1.4.6