求二叉树中序遍历的第一个结点（向左一路狂奔吧）

#include<iostream>
#define N 15

using namespace std;

char str[] = "ab#d##c#e##";
int i = -1;

typedef struct node
{
	struct node *leftChild;
	struct node *rightChild;
	char data;
}BiTreeNode, *BiTree;

//生成一个结点
BiTreeNode *createNode(int i)
{
	BiTreeNode * q = new BiTreeNode;
	q->leftChild = NULL;
	q->rightChild = NULL;
	q->data = i;

	return q;
}

BiTree createBiTree1()
{
	BiTreeNode *p[N] = {NULL};
	int i;
	for(i = 0; i < N; i++)
		p[i] = createNode(i + 1);

	// 把结点连接成树
	for(i = 0; i < N/2; i++)
	{
		p[i]->leftChild = p[i * 2 + 1];
		p[i]->rightChild = p[i * 2 + 2];
	}

	return p[0];
}

void createBiTree2(BiTree &T)
{
	i++;
	char c;
	if(str[i] && '#' == (c = str[i]))
		T = NULL;
	else
	{
		T = new BiTreeNode;
		T->data = c;
		createBiTree2(T->leftChild);
		createBiTree2(T->rightChild);
	}
}

BiTreeNode *getFirstNodeUsingInOrderTraverse(BiTree T)
{
	if(NULL == T)
		return NULL;

	while(NULL != T->leftChild) 
		T = T->leftChild; //向左一路狂奔，直到不能向左为止

	return T;
}

int main()
{
	BiTree T1;
	T1 = createBiTree1();
	//因为要输出整数(而非字符)，所以下面用printf函数
	printf("%d\n",getFirstNodeUsingInOrderTraverse(T1)->data);

	BiTree T2;
	createBiTree2(T2);
	cout << getFirstNodeUsingInOrderTraverse(T2)->data << endl;

	return 0;
}