（二叉搜索树6-5）No Greater Than X in BST--C语言

You are supposed to output, in decreasing order, all the elements no greater than X in a binary search tree T.

Format of function:

void Print_NGT( Tree T,  int X );

where Tree is defined as the following:

typedef struct TreeNode *Tree;
struct TreeNode {
int Element;
Tree Left;
Tree Right;
};

The function is supposed to use Output(X) to print X.

Sample program of judge:

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

typedef struct TreeNode *Tree;
struct TreeNode {
    int Element;
    Tree  Left;
    Tree  Right;
};

Tree BuildTree(); /* details omitted */
void Output( int X ); /* details omitted */

void Print_NGT( Tree T,  int X );

int main()
{
    Tree T;
    int X;

    T = BuildTree();
    scanf("%d", &X);
    Print_NGT( T, X );
    printf("End\n");

    return 0;
}

/* Your function will be put here */

Sample Output 1(for the tree shown in Figure 1):

91 90 85 81 80 55 End

Sample Output 2(for the tree shown in Figure 2):

End

Analysis:

先向右边找最大的数，然后和X比较，比X大的数不输出，小于等于X的数输出。

Code:

//按递减的顺序输出比X小的数，包括等于X的数
void Print_NGT( Tree T,  int X )
{
    if(T == NULL)return;
    Print_NGT(T->Right,X);//从右子树的最后一个结点开始，即树的最大值
    if(T->Element<=X){
        printf("%d ",T->Element);
    }
    Print_NGT(T->Left,X);
}