Binary_Tree_POSTORDER.cpp

// Binary Tree POSTORDER Traversal
#include <iostream>
using namespace std;

struct node
{
    int data;

    node *left;
    node *right;

    node(int data)
    {
        this->data = data;
        left = right = NULL;
    }
};
void Postorder(node *root)
{
    if (root == NULL)
    {
        return;
    }
    Postorder(root->left);

    Postorder(root->right);

    cout << root->data << " ";
}

int main()
{
    node *root = new node(1);

    root->left = new node(2);
    root->right = new node(3);

    root->left->left = new node(4);
    root->left->right = new node(5);

    Postorder(root);

    return 0;
}