1118

surajr · surajr · commit 2341db94ecfc · 2017-11-18T16:02:10.000-08:00
diff --git a/README.md b/README.md
@@ -142,6 +142,7 @@ Feel free to submit pull requests, add issues and be a contributer.
 | Leetcode  | [298. Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/description/) | [Java](./java/longestConsecutive.java)  |   O(n)     |   O(n)        |  Medium    |         |
 | Leetcode  | [314. Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/description/) | [Java](./java/verticalOrder.java)  |   O(n)     |   O(n)        |  Medium    |         |
 | Leetcode  | [437. Path Sum III](https://leetcode.com/problems/path-sum-iii/description/) | [Java](./java/pathSumiii.java)  |   O(n)     |   O(1)        |  Easy     |         |
+| Leetcode  | [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/description/) | [Java](./java/findBottomLeftValue.java)  |   O(n^2)     |   O(1)        |  Medium     |         |
 | Leetcode  | [530. Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/) | [Java](./java/getMinimumDifference.java)  |   O(v + e)     |   O(1)        |  Easy      |         |
 | Leetcode  | [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/description/) | [Java](./java/diameterOfBinaryTree.java)  |   O(v + e)     |   O(1)        |  Easy      |         |
 | Leetcode  | [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/description/) | [Java](./java/isSubtree.java)  |   O(m2+n2+mn)     |   O(max(m,n)        |  Easy      |         |
diff --git a/java/findBottomLeftValue.java b/java/findBottomLeftValue.java
@@ -0,0 +1,31 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public int findBottomLeftValue(TreeNode root) {
+        if(root == null) return 0;
+        
+        int result = 0;
+        Queue<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+        
+        while(!queue.isEmpty())
+        {
+            int size = queue.size();
+            for(int i=0; i<size; i++)
+            {
+                TreeNode node = queue.poll();
+                if(i==0) result = node.val;
+                if(node.left != null) queue.add(node.left);
+                if(node.right != null) queue.add(node.right);
+            }
+        }
+        return result;
+    }
+}
