计算任意二叉树T中其数据域大于等于x的结点个数并返回该值

#include <stdio.h>
typedef struct node {

	int data;
	struct node* lchild, * rchild;
}BinTNode;
int SearchXNum(BinTNode *T,int x){
	int n;
	if (T==NULL) {
		return 0;
	}
	if (T->data>=x) {
		n = 1;
	}
	else
	{
		n = 0;
	}
	return n + SearchXNum(T->lchild,x) + SearchXNum(T->rchild,x);
}