find leaves of binary tree

Author: fishercoder1534

MEDIUM/src/medium/FindLeavesofBinaryTree.java

@@ -0,0 +1,26 @@
+package medium;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import classes.TreeNode;
+
+public class FindLeavesofBinaryTree {
+
+    List<List<Integer>> result = new ArrayList<List<Integer>>();
+    public List<List<Integer>> findLeaves(TreeNode root) {
+        dfs(root);
+        return result;
+    }
+    
+    int dfs(TreeNode root){
+        if(root == null) return 0;
+        int level = Math.max(dfs(root.left), dfs(root.right))+1;
+        if(result.size() < level){
+            result.add(new ArrayList<Integer>());
+        }
+        result.get(level-1).add(root.val);
+        return level;
+    }
+
+}

README.md

@@ -32,6 +32,7 @@
 |379|[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/)|[Solution](../../blob/master/MEDIUM/src/medium/DesignPhoneDirectory.java)| O(1)|O(n) | Medium| 
 |374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)|[Solution](../../blob/master/EASY/src/easy/GuessNumberHigherorLower.java)| O(logn)|O(1) | Easy| Binary Search
 |370|[Range Addition](https://leetcode.com/problems/range-addition/)|[Solution](../../blob/master/MEDIUM/src/medium/RangeAddition.java)| O(n+k)|O(1) | Medium| 
+|366|[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/)|[Solution](../../blob/master/MEDIUM/src/medium/FindLeavesofBinaryTree.java)| O(n)|O(h) | Medium| DFS
 |359|[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/)|[Solution](../../blob/master/EASY/src/easy/LoggerRateLimiter.java)| amortized O(1)|O(k) | Easy| HashMap
 |350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)|[Solution](../../blob/master/EASY/src/easy/IntersectionOfTwoArraysII.java)| O(m+n)|O((m+n)) could be optimized | Easy| HashMap, Binary Search
 |349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[Solution](../../blob/master/EASY/src/easy/IntersectionOfTwoArrays.java)| O(m+n)|O(min(m,n)) | Easy| Two Pointers, Binary Search