Merge pull request #3107 from prajval-malhotra/0145-binary-tree-postorder-traversal

create: 0145-binary-tree-postorder-traversal.cpp

Author: sujal-goswami

Diff for: cpp/0145-binary-tree-postorder-traversal.cpp

@@ -0,0 +1,25 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    vector<int> postorderTraversal(TreeNode* root) {
+        if(!root) return {}; 
+
+        postorderTraversal(root->left);
+        postorderTraversal(root->right);
+        result.push_back(root->val);
+        
+        return result;
+    }
+private:
+    vector<int> result;
+};