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