An Algorithm a Day: Reverse in-order traversal of BST
In-order means left-root-right. :)
You can also do right-root-left. :D It's just the way of traversal, that's it!! :)
In-order means left-root-right. :)
You can also do right-root-left. :D It's just the way of traversal, that's it!! :)
void descending(BST* root)
{
if(root == NULL) return;
descending(root->right);
std::cout<<root->data<<" ";
descending(root->left);
}Read full article from An Algorithm a Day: Reverse in-order traversal of BST
