6-88 Print the right subtree of X in BST

Given a binary search tree T, you are supposed to output all the elements in the right subtree of X, in decreasing order.

Format of functions:

void print_right_subtree( Tree T, int X );

where Tree is defined as:

typedef struct TreeNode *Tree;
struct TreeNode {
    int element;
    Tree left;
    Tree right;
};

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>

typedef struct TreeNode *Tree;
struct TreeNode {
    int element;
    Tree left;
    Tree right;
};

Tree build_tree(); /* details omitted */

void print_right_subtree(Tree T, int X);

int main()
{
    Tree T;
    int X;

    T = build_tree();
    scanf("%d", &X);
    print_right_subtree(T, X);

    return 0;
}

/* Your function(s) will be put here */