将叶子节点链接为双链表（c++）

#include<iostream>
using namespace std;
int flag = 1;
typedef struct BiTNode
{
	char data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
void CreatBitree(BiTree& T, char e)
{
	if (T == NULL)
	{
		T = new BiTNode;
		T->data = e;
		T->lchild = NULL;
		T->rchild = NULL;
	}
	else if (T->data < e)
		CreatBitree(T->rchild, e);
	else if (T->data > e)
		CreatBitree(T->lchild, e);
}
void Leaf(BiTree& T, BiTree& head, BiTree& rear) {
	if (T)
	{
		Leaf(T->lchild, head, rear);
		Leaf(T->rchild, head, rear);
		if (T->lchild == NULL && T->rchild == NULL)
		{
			if (flag)
			{
				head = new BiTNode;
				rear = T;
				head->lchild = rear;
				flag = 0;
			}
			else
			{
				rear->lchild = T;
				T->rchild = rear;
				rear = T;
			}
		}
		rear->lchild = NULL;
	}
}
void Output(BiTree& head) {

	BiTree rear = head->lchild;
	while (rear) {

		cout << rear->data;
		rear = rear->lchild;
	}
}
int main()
{
	BiTree T;
	T = NULL;
	char s[200];
	cin >> s;
	for (int i = 0; i < strlen(s); i++)
	{
		CreatBitree(T, s[i]);
	}
	BiTree head, rear;
	Leaf(T, head, rear);
	Output(head);
	return 0;
}