if i want to recursivly print out a binary tree from lowest to highest order should i recursivly go to max first then work it to the lowest and end with a cout<<leaf->blah;
i'm having a little trouble with this heh.
in the binary tree tutorials the delete_tree(node *leaf) function i thought would do it if i changed it to print ---
if(leaf!=NULL)
{
print_tree(leaf->left);
print_tree(leaf->right);
cout<<endl<<leaf->string;
}
but it prints out garbage :P