中序遍历非递归（两种解法）

typedef struct BTNode{
    char data;
    struct BTNode* left;
    struct BTNode* right;
}BTNode;

typedef struct Stack{
    BTNode* data[MaxSize];
    int top;
}Stack;

//方法一：左子树往左入栈，走过一次左子树后不会在走，出栈时往又结点走。
void InOrderT(BTNode* bt){
    BTNode* Stack[MaxSize];
    int top = -1;
    BTNode* q = bt;
    while (q || top != -1) {
        while (q) {
            Stack[++top] = q;
            q = q->left;
        }
        if (top != -1) {
            q = Stack[top--];
            cout<<"data:"<<q->data<<endl;
            q = q->right;
        }
    }
}

//方法二：借助辅助结点判断是否访问已经访问左子树，避免重复访问。
void InOrder(BTNode* root){
    if (root == NULL) {
        return;
    }
    Stack stack;
    stack.top = -1;
    
    //Root gets into stack
    stack.data[++(stack.top)] = root;
    BTNode* q;
    
	//record if it has been visited.
    int visit = 0;
    
    while (stack.top != -1) {
        q = stack.data[stack.top];
        if (q->left && visit == 0) {
            stack.data[++(stack.top)] = q->left;
        }else{
            q = stack.data[(stack.top--)];
            visit = 1;
            cout<< "current data : " << q->data << "\n";
            if (q->right) {
                stack.data[++(stack.top)] = q->right;
                visit = 0;
            }
        }
    }
}