#include <bits/stdc++.h>
using namespace std;

class TreeNode
{ // tree node is defined
public:
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int data)
    {
        val = data;
        left = NULL;
        right = NULL;
    }
};

void reverse_inorder(TreeNode *root)
{
    // base case
    if (root == NULL)
        return;

    // secondly traverse right sub tree
    reverse_inorder(root->right);

    // finally traverse current node
    printf("%d ", root->val);

    // fisrt traverse left sub tree
    reverse_inorder(root->left);
}

int main()
{
    // building the tree
    TreeNode *t = new TreeNode(7);
    t->left = new TreeNode(1);
    t->left->left = new TreeNode(0);
    t->left->right = new TreeNode(3);
    t->left->right->left = new TreeNode(2);
    t->left->right->right = new TreeNode(5);
    t->left->right->right->left = new TreeNode(4);
    t->left->right->right->right = new TreeNode(6);
    t->right = new TreeNode(9);
    t->right->left = new TreeNode(8);
    t->right->right = new TreeNode(10);

    printf("Reverse Inorder traversal tree is:\n");
    reverse_inorder(t);

    return 0;
}

Output 

Reverse Inorder traversal tree is:
10 9 8 7 6 5 4 3 2 1 0