The correct, optimal and working solution for programming question binary-tree-postorder-traversal on leetcode

/* * Author: Arpit Bhayani * https://arpitbhayani.me */ #include <cmath> #include <cstdio> #include <cstdlib> #include <climits> #include <deque> #include <iostream> #include <list> #include <limits> #include <map> #include <queue> #include <set> #include <stack> #include <vector> #define ll long long #define MIN(a, b) a < b ? a : b #define MAX(a, b) a > b ? a : b using namespace std; int readline(char *str) { int i = 0; char ch; while((ch = getchar()) != '\n') { str[i++] = ch; } str[i] = '\0'; return i; } struct node { int val; struct node * left; struct node *right; }; struct node * new_node(int val) { struct node *t = (struct node *) malloc(sizeof(struct node)); t->val = val; t->left = t->right = NULL; return t; } void _postorder(struct node * root, vector<int> &order) { if(root == NULL) { return; } _postorder(root->left, order); _postorder(root->right, order); order.push_back(root->val); } vector<int> postorderTraversal(struct node * root) { vector<int> order; _postorder(root, order); return order; } int main(int argc, char *argv[]) { struct node * root = NULL; root = new_node(1); root->left = new_node(2); root->right = new_node(3); postorderTraversal(root); return 0; }