Add solution #366

Author: JoshCrozier

README.md

@@ -354,6 +354,7 @@
 363|[Max Sum of Rectangle No Larger Than K](./solutions/0363-max-sum-of-rectangle-no-larger-than-k.js)|Hard|
 364|[Nested List Weight Sum II](./solutions/0364-nested-list-weight-sum-ii.js)|Medium|
 365|[Water and Jug Problem](./solutions/0365-water-and-jug-problem.js)|Medium|
+366|[Find Leaves of Binary Tree](./solutions/0366-find-leaves-of-binary-tree.js)|Medium|
 367|[Valid Perfect Square](./solutions/0367-valid-perfect-square.js)|Easy|
 368|[Largest Divisible Subset](./solutions/0368-largest-divisible-subset.js)|Medium|
 371|[Sum of Two Integers](./solutions/0371-sum-of-two-integers.js)|Medium|

solutions/0366-find-leaves-of-binary-tree.js

@@ -0,0 +1,43 @@
+/**
+ * 366. Find Leaves of Binary Tree
+ * https://leetcode.com/problems/find-leaves-of-binary-tree/
+ * Difficulty: Medium
+ *
+ * Given the root of a binary tree, collect a tree's nodes as if you were doing this:
+ * - Collect all the leaf nodes.
+ * - Remove all the leaf nodes.
+ * - Repeat until the tree is empty.
+ */
+
+/**
+ * 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 findLeaves = function(root) {
+  const levels = [];
+  getHeight(root);
+  return levels;
+
+  function getHeight(node) {
+    if (!node) return -1;
+
+    const leftHeight = getHeight(node.left);
+    const rightHeight = getHeight(node.right);
+    const height = Math.max(leftHeight, rightHeight) + 1;
+
+    if (levels.length <= height) {
+      levels.push([]);
+    }
+    levels[height].push(node.val);
+
+    return height;
+  }
+};