int main()
{	
	Solution c;
    TreeNode *rootA, *rootB;
    int A[] = {0,1,2,3,4,5,6,7};
    rootA = c.trans(A,1,sizeof(A)/4);
	c.printTree(rootA); //前序序列:1 2 4 5 3 6 7
	c.TreeMirror(rootA);
	cout << endl;
	c.printTree(rootA); //镜像的前序序列: 1 3 7 6 2 5 4
	return 0;
}