二叉排序树中输出特定值（c++）

#include<iostream>
using namespace std;
int c[200];
int k;
int flag;     //题目中要求要间隔空格输出，设置flag来切换空格输出
typedef struct BiTNode
{
	char data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
void  Creatbitree(BiTree& T, char e)
{
	if (!T)
	{
		T = new BiTNode;
		T->data = e;
		T->lchild = NULL;
		T->rchild = NULL;
	}
	else
	{
		if (T->data < e)
			Creatbitree(T->rchild, e);
		else
			Creatbitree(T->lchild, e);
	}
}
void FindNumber(BiTree T, int n, int key)
{
	if (T)
	{
		FindNumber(T->lchild, n, key);
		c[k++] = T->data;
		if (c[k] >= T->data)
		{
			if (flag == 0)
			{
				cout << c[k];
				flag = 1;
			}
			else
				cout << " " << c[k];
		}
		FindNumber(T->rchild, n, key);
	}
}
int main()
{
	BiTree T;
	int n;
	char e, key;
	while (cin >> n && n)
	{
		T = NULL;
		for (int i = 0; i < n; i++)
		{
			cin >> e;
			Creatbitree(T, e);
		}
		cin >> key;
		flag = 0;
		FindNumber(T, n, key);
	}
	return 0;
}