C++实现二叉树后序非递归遍历（直接复制粘贴运行，无需修改）

#define max_stack 100
#include<iostream>
#include<stdlib.h>

// 定义二叉树节点结构体
typedef struct TB {
    struct TB* lchild;  // 左子树指针
    struct TB* rchild;  // 右子树指针
    int data;  // 节点数据
} BTnode, *BTree;

// 后序遍历二叉树的函数
void hou(BTree T) {
    BTree p = T, q, s1[max_stack];
    int top = -1, s2[max_stack] = { 0 }, flag;

    // 当树非空或栈非空时循环
    while (p || top >= 0) {
        // 沿左子树路径将节点入栈，并标记为第一次访问
        while (p) {
            s1[++top] = p;
            s2[top] = 0;
            p = p->lchild;
        }

        // 取出栈顶节点和访问标记
        p = s1[top];
        flag = s2[top--];

        // 如果是第二次访问该节点
        if (flag == 0) {
            // 重新入栈并标记为第二次访问，然后处理右子树
            s1[++top] = p;
            s2[top] = 1;
            p = p->rchild;
        } else {
            // 输出节点数据，将当前节点置为空，继续循环
            printf("%d", p->data);
            p = NULL;
        }
    }
}

int main() {
    // 动态分配根节点内存
    BTree T = (BTree)malloc(sizeof(BTnode)), t1, t2, t3, t4, t5;

    // 初始化二叉树结构
    T->data = 0;
    T->lchild = (BTree)malloc(sizeof(BTnode));
    T->rchild = (BTree)malloc(sizeof(BTnode));
    t1 = T->lchild;
    t2 = T->rchild;
    t1->data = 1;
    t2->data = 2;
    t1->lchild = NULL;
    t1->rchild = NULL;
    t2->lchild = (BTree)malloc(sizeof(BTnode));
    t2->rchild = (BTree)malloc(sizeof(BTnode));
    t3 = t2->lchild;
    t4 = t2->rchild;
    t3->data = 3;
    t4->data = 4;
    t3->lchild = NULL;
    t3->rchild = NULL;
    t4->lchild = NULL;
    t4->rchild = NULL;

    // 调用后序遍历函数
    hou(T);

    return 0;
}

在main()中创建的二叉树：

运行结果：