Add solution #145

Author: JoshCrozier

README.md

@@ -47,6 +47,7 @@
 136|[Single Number](./0136-single-number.js)|Easy|
 141|[Linked List Cycle](./0141-linked-list-cycle.js)|Easy|
 144|[Binary Tree Preorder Traversal](./0144-binary-tree-preorder-traversal.js)|Easy|
+145|[Binary Tree Postorder Traversal](./0145-binary-tree-postorder-traversal.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
 203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|

solutions/0145-binary-tree-postorder-traversal.js

@@ -0,0 +1,32 @@
+/**
+ * 145. Binary Tree Postorder Traversal
+ * https://leetcode.com/problems/binary-tree-postorder-traversal/
+ * Difficulty: Easy
+ *
+ * Given the root of a binary tree, return the postorder traversal
+ * of its nodes' values.
+ */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[]}
+ */
+var postorderTraversal = function(root) {
+  if (!root) {
+    return [];
+  }
+
+  return [
+    ...postorderTraversal(root.left),
+    ...postorderTraversal(root.right),
+    root.val
+  ];
+};