@@ -0,0 +1,811 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public int findBottomLeftValue(TreeNode root) %7B%0A        if(root.left == null && root.right == null)%7B%0A            return root.val;%0A        %7D%0A        int%5B%5D res = new int%5B2%5D;%0A        res%5B1%5D = 1;%0A        res%5B0%5D = root.val;%0A        return dfs(root,1,res);%0A    %7D%0A    %0A    private int dfs(TreeNode root, int depth, int%5B%5Dres)%7B%0A        if(depth%3Eres%5B1%5D)%7B%0A            res%5B1%5D = depth;%0A            res%5B0%5D =root.val;%0A        %7D%0A        if(root.left != null)%7B%0A            dfs(root.left,depth+1,res);%0A        %7D%0A        if(root.right != null)%7B%0A            dfs(root.right, depth+1,res);%0A        %7D%0A        return res%5B0%5D;%0A    %7D%0A%7D

The solution for 513