将二叉树叶子结点的值连成一个链表

//将二叉树叶子结点的值连成一个链表
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
using namespace std;
#define Max 10

typedef struct treenode {
char data;
struct treenode* lchild, * rchild;
}treenode, * tree;

void creatTree(tree& t) {
char ch;
ch = getchar();
if (ch == ‘#’) t = NULL;
else {
t = (treenode*)malloc(sizeof(treenode));
t->data = ch;
t->lchild = NULL;
t->rchild = NULL;
creatTree(t->lchild);
creatTree(t->rchild);

}

}
tree head=(treenode*)malloc(sizeof(treenode)), pre = NULL;

tree inorder(tree &t) {
if (t) {
inorder(t->lchild);
if (t->lchild == NULL && t->rchild == NULL) {
if (pre == NULL) {
head = t;
pre = t;
}

		else {
			pre->rchild = t;
			pre = t;

		}
	}
	inorder(t->rchild);
	pre->rchild = NULL;
}
return head;

}

int main() {
tree t;
creatTree(t);
inorder(t);
while (head) {
printf(“%c”, head->data);
head = head->rchild;
}
return 0;
}