Thread: Binary Tree Help

I have written a binary tree program in C++ which prints out the contents of the tree in order. I now need a function thats prints it out in descending order. I am having a some trouble with this so any help would be greatly appreciated.

Many Thanks


Temden

>> I am having a some trouble with this

Trouble with what exactly?

First post what you already have, then somenone may be able to help you.

Code:

 void print2(struct tree* root) {   
 struct tree  *lowertree, *highertree;
   highertree=root->higher;
   lowertree=root->lower;
   if (lowertree)
      print(lowertree);
       if (root->value != NULL)
        cout<<root->value<<endl;
   if (highertree)
      print(highertree);
           }

This Code prints the tree in order how would I change this to make it print the opposite way round decending order.

Thanks so much I had switched the calls but ive just realised instead of the function calling itself it calls another function that prints inorder.

Thanks for your help.