二叉树中求值为k的结点的层数

/**
*2018.10.24 14:47
*二叉树中求值为k的结点的层数
*/
#include<stdio.h>

#define MAX 100

typedef char Elem;

typedef struct BTNode{
	Elem e;
	struct BTNode* lchild;
	struct BTNode* rchild;
}BTNode;


int getLevel(BTNode* T, Elem k);

int main(void) {
	
	
	putchar('\n');
	system("pause");
	return 0;
}

int level = 1;
int getLevel(BTNode* T, Elem k) {
	
	if (T->e == k) 
		printf("%d ", level);
	
	++level;

	getLevel(T->lchild, k);
	getLevel(T->rchild, k);

	--level;

}