根据前序扩展二叉树序列还原二叉树

设计思路

由扩展的二叉树的前序序列，可唯一确定一个二叉树

# include <iostream>
# include <stdlib.h>
using namespace std;

typedef char elementType;

struct Node
{
	elementType data;
	Node* left;
	Node* right;
};

void preOrder(Node* root)
{
	if (root == NULL)
	{
		return;
	}
	cout << root->data << " ";
	preOrder(root->left);
	preOrder(root->right);
}

void inOrder(Node* root)
{
	if (root == NULL)
	{
		return;
	}
	inOrder(root->left);
	cout << root->data << " ";
	inOrder(root->right);
}

Node* createTreeByExtendStr(string extendStr, int& startIndex)
{
	Node* node = (Node*)malloc(sizeof(Node));
	if (node == NULL)
	{
		cout << "内存不足,空间分配出错" << endl;
		return NULL;
	}

	if (startIndex == extendStr.length() || extendStr[startIndex] == '.')
	{
		node = NULL;
		return node;
	}
	node->data = extendStr[startIndex];

	startIndex += 1;
	Node* left = createTreeByExtendStr(extendStr, startIndex);
	startIndex += 1;
	Node* right = createTreeByExtendStr(extendStr, startIndex);

	node->left = left;
	node->right = right;

	return node;
}

int main()
{
	string extendStr = "AB.D..CE...";
	int startIndex = 0;
	Node* root = createTreeByExtendStr( extendStr, startIndex);

	inOrder(root);
	cout << endl << "************************" << endl;
	preOrder(root);
}

/*
AB.D..CE...
*/