1127. ZigZagging on a Tree

思路：通过递归，利用后序遍历和中序遍历进行建树，最后返回根结点，输出时，使用了两个辅助栈，单数栈和双数栈，单数栈对应的单数行的节点，单数栈压入栈的时候先压左节点，后压右节点，并且将结点压入双数栈，两个栈互相交替。并在压入栈的同时输出该结点的值。

#include<iostream>
#include<queue>
#include<stack>
#define MaxSize 50
using namespace std;
int postOrder[MaxSize], inOrder[MaxSize];
typedef struct Tree {
	int value;
	Tree *left, *right;
}treenode,*TreeNode;
TreeNode createTree(int postL,int postR,int inL,int inR ){
	if (postL > postR) return NULL;
	TreeNode root = (TreeNode)malloc(sizeof(treenode));
	root->value = postOrder[postR];
	int index;
	for (index=inL; index<= inR; index++) {//找到根结点
		if (postOrder[postR] == inOrder[index])
			break;
	}
	int numberLeft = index - inL;//左子树的节点个数
	root->left = createTree(postL, postL + numberLeft - 1, inL, numberLeft);
	root->right = createTree(postL+numberLeft, postR - 1, index + 1, inR);
	return root;
}
int main()
{
	int N;
	TreeNode root;
	cin >> N;
	if (N == 0) {
		return 0;
	}
	for (int i = 1; i <= N; i++) {
		cin >> inOrder[i];
	}
	for (int i = 1; i <=N; i++) {
		cin >> postOrder[i];
	}
	root=createTree(1,N,1,N);
	stack<TreeNode> Node_odd;//单数栈
	stack<TreeNode>Node_complex;//双数栈
	Node_odd.push(root);//先把根结点输出
	cout << root->value;
	while (!Node_complex.empty() || !Node_odd.empty()) {//两个栈只要有一个非空就可以
		while (!Node_odd.empty()) {
			TreeNode node = Node_odd.top();
			Node_odd.pop();
			if (node->left != NULL) {
				Node_complex.push(node->left);//将单数栈的节点压入双数栈
				cout <<" "<< node->left->value;
			}
			if (node->right != NULL)
			{
				Node_complex.push(node->right);
				cout << " " << node->right->value;
			}
		}
		while (!Node_complex.empty()) {
			TreeNode node = Node_complex.top();
			Node_complex.pop();
			if (node->right != NULL)
			{
				Node_odd.push(node->right);//双数栈的节点压入单数栈
				cout << " " << node->right->value;
			}
			if (node->left != NULL) {
				Node_odd.push(node->left);
				cout << " " << node->left->value;
			}
		}
	}
    return 0;
}  

但是！！！有一个测试点没有通过，希望有大佬能帮我指出来！