回顾二叉树，采用增加线索确定根节点

// testTree.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <map>

using namespace std;

typedef struct treeNode{
	treeNode * left;
	treeNode * right;

	//用来记录父节点，便于查找出根节点
	treeNode * pre;
	long id;
	long lvalue;

}treeNode;

void testTree(vector<int> &leftG, vector<int> &rightG, vector<int> &idG)
{

}

treeNode * createTree(vector<int> &leftG, vector<int> &rightG, vector<int> &idG)
{
	map<int, treeNode*> nodeMap;
	//生成所有节点
	for (unsigned int i = 0; i < idG.size(); i++)
	{
		int va = leftG[i];
		if (nodeMap[va] == 0)
		{
			treeNode * p = new treeNode;
			p->lvalue = va;
			p->left = NULL;
			p->right = NULL;
			p->pre = NULL;
			nodeMap[va] = p;
		}

		va = rightG[i];
		if (nodeMap[va] == 0)
		{
			treeNode * p = new treeNode;
			p->lvalue = va;
			p->left = NULL;
			p->right = NULL;
			p->pre = NULL;
			nodeMap[va] = p;
		}

		va = idG[i];
		if (nodeMap[va] == 0)
		{
			treeNode * p = new treeNode;
			p->lvalue = va;
			p->left = NULL;
			p->right = NULL;
			p->pre = NULL;
			nodeMap[va] = p;
		}

	}

	//在节点间进行连接
	for (unsigned int i = 0; i < idG.size(); i++)
	{
		int leftId = leftG[i];
		int rightId = rightG[i];
		long id = idG[i];
		treeNode * p = nodeMap[id];
		treeNode * lNode = nodeMap[leftId];
		treeNode * rNode = nodeMap[rightId];
		p->left = lNode;
		lNode->pre = p;
		p->right = rNode;
		rNode->pre = p;

	}

	if (idG.size() > 0)
	{
		treeNode * root = nodeMap[idG[0]];
		while(root->pre != NULL)
		{
			root = root->pre;
		}

		return root;
	}
	
	return NULL;
}

void printTree(treeNode * root)
{

	if (root->left == NULL && root->right == NULL)
	{
		cout << root->lvalue;
		return;
	}

	cout << "(";
	printTree(root->left);
	cout << ", ";
	printTree(root->right);
	cout << ")";
}


void removeTree(treeNode* root)
{
	if (root == NULL)
	{
		return;
	}

	removeTree(root->left);
	removeTree(root->right);
	delete root;
	root = NULL;
}


int _tmain(int argc, _TCHAR* argv[])
{
	vector<int> leftG;
	vector<int> rightG;
	vector<int> idG;

	leftG.push_back(1);
	rightG.push_back(2);
	idG.push_back(10001);
	leftG.push_back(3);
	rightG.push_back(4);
	idG.push_back(10002);


	leftG.push_back(10003);
	rightG.push_back(5);
	idG.push_back(10005);


	leftG.push_back(10001);
	rightG.push_back(10002);
	idG.push_back(10003);



	treeNode * root = createTree(leftG, rightG, idG);
	printTree(root);

	removeTree(root);

	return 0;
}