Author: Anonymous Language: text
Description: No description Timestamp: 2008-11-20 08:49:37 -0400
View raw paste Reply
  1. void infix(bst tree)                   // add n to the tree
  2. {
  3.         if ( tree != 0 )               // do nothing if the tree is empty
  4.         {
  5.                 infix(tree.left) ;    // traverse the left children
  6.                 print tree.value;     // print the value in this node
  7.                 infix(tree.right) ;   // traverse the right children
  8.         }
  9. }
  10.  
View raw paste Reply