二叉树存储结构:
typedef struct Tnode
{
char data;
struct Tnode *lnode;
struct Tnode *rnode;
}Tnode;
typedef Tnode* type;
问题求解:
int count = 1;
char getvalue10(Tnode *root, int k)
{
char ch;
if (!root)
return '#';
else if (count++ == k)
return root->data;
else if ( (ch = getvalue10(root->lnode, k)) != '#')//注意赋值号的优先级低
return ch;
else return getvalue10(root->rnode, k);
}