Method 3 - DFS

Code

[{"language":"Java","code":"class Solution {\n\tpublic int findBottomLeftValue(TreeNode root) {\n\t\treturn findBottomLeftValue(root, 1, new int[]{0,0});\n\t}\n\tpublic int findBottomLeftValue(TreeNode root, int depth, int[] res) {\n\t\tif (res[1]<depth) {\n\t\t\tres[0]=root.val;\n\t\t\tres[1]=depth;\n\t\t}\n\t\tif (root.left!=null) {\n\t\t\tfindBottomLeftValue(root.left, depth+1, res);\n\t\t}\n\t\tif (root.right!=null) {\n\t\t\tfindBottomLeftValue(root.right, depth+1, res);\n\t\t}\n\t\treturn res[0];\n\t}\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">\tpublic</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> findBottomLeftValue</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(TreeNode </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">root</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">\t\treturn</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> findBottomLeftValue</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(root, </span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\">1</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">new</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[]{</span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\">0</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">,</span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\">0</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">});</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">\t}</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">\tpublic</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> findBottomLeftValue</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(TreeNode </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">root</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> depth</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[] </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">res</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">\t\tif</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> (res[</span><span style=\"color:#005CC5;--shiki-dark:#79B8FF\">1</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">]</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">&#x3C;</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">depth) {</span></span>\n<span class=\"line\"><span sty
Related Tags
