二叉树后序遍历 -- Life at NFLSCode 2020/12/27

相信童鞋们都学过二叉树后序遍历。不用多说，直接贴代码

#include "_"

_______________<________> __[________________];
__________________ _____(________ _______)
{
    _________________ (_______==- _____________)__________;
    _________________ (__[_______][____________]==- _____________&&__[_______][_____________]==- _____________)
    {
        _________("%d ",_______);
        __________;
    }
    _____(__[_______][____________]);
    _____(__[_______][_____________]);
    _________("%d ",_______);
}
________ ____________________()
{
    ________ ___;
    ___________>>___;
    ______________ (________ ______=_____________;______<=___;++______)
    {
        ________ _,____;
        ___________>>_>>____;
        __[______].___________________(_);
        __[______].___________________(____);
    }
    _____(_____________);
    __________ ____________;
}

这什么鬼？！？（放心，编译不通过）

不过……

#include <bits/stdc++.h>
using namespace std;
#define ________ int
#define _________ printf
#define __________ return
#define ___________ cin
#define ____________ 0
#define _____________ 1
#define ______________ for
#define _______________ vector
#define ________________ 1005
#define _________________ if
#define __________________ void
#define ___________________ push_back
#define ____________________ main

二叉树后序遍历 -- Life at NFLSCode 2020/12/27

原文：https://www.cnblogs.com/zerocode/p/life_20201227.html