《LeetCode力扣练习》代码随想录——二叉树（找树左下角的值---Java）

《LeetCode力扣练习》代码随想录——二叉树（找树左下角的值—Java）

---

---

刷题思路来源于 代码随想录

---

513. 找树左下角的值

• 二叉树

  /**
   * Definition for a binary tree node.
   * public class TreeNode {
   * int val;
   * TreeNode left;
   * TreeNode right;
   * TreeNode() {}
   * TreeNode(int val) { this.val = val; }
   * TreeNode(int val, TreeNode left, TreeNode right) {
   * this.val = val;
   * this.left = left;
   * this.right = right;
   * }
   * }
   */
  class Solution {
  
      private int result;
      private int maxDepth = Integer.MIN_VALUE;
  
      public int findBottomLeftValue(TreeNode root) {
  
          recursion(root, 1);
          return result;
  
      }
  
      private void recursion(TreeNode root, int depth) {
  
          if (root.left == null && root.right == null) {
  
              if (depth > maxDepth) {
                  maxDepth = depth;
                  result = root.val;
              }
  
          }
  
          if (root.left != null) {
  
              depth++;
              recursion(root.left, depth);
              depth--;
  
          }
  
          if (root.right != null) {
  
              depth++;
              recursion(root.right, depth);
              depth--;
  
          }
  
      }
  }
  1
  2
  3
  4
  5
  6
  7
  8
  9
  10
  11
  12
  13
  14
  15
  16
  17
  18
  19
  20
  21
  22
  23
  24
  25
  26
  27
  28
  29
  30
  31
  32
  33
  34
  35
  36
  37
  38
  39
  40
  41
  42
  43
  44
  45
  46
  47
  48
  49
  50
  51
  52
  53
  54
  55
  56

---