二叉树后序遍历(递归)

#include <iostream>
using namespace std;

struct Node
{
    int value;
    Node *left;
    Node *right;
};

void  postorderTraverse(Node *root)
{
    if (NULL == root)
    {
        return;
    }

    postorderTraverse(root->left);
    postorderTraverse(root->right);
    cout << root->value << " ";
}