char traverse1(BiTree T,int k)
{
int count=1;
char ch;
if(!T)
return '#';
else
{
if((ch=traverse1(T->nextleft,k))!='#')
return ch;
else if(count++==k)
return T->data;
else return traverse1(T->nextleft,k);
}
}