README ¶ https://leetcode.cn/problems/find-bottom-left-tree-value/ 513. 找树左下角的值 中等 给定一个二叉树的 根节点 root,请找出该二叉树的 最底层 最左边 节点的值。 假设二叉树中至少有一个节点。 示例 1: 输入: root = [2,1,3] 输出: 1 示例 2: 输入: [1,2,3,4,null,5,6,null,null,7] 输出: 7 提示: 二叉树的节点个数的范围是 [1,104] -231 <= Node.val <= 231 - 1 Expand ▾ Collapse ▴ Documentation ¶ Index ¶ type TreeNode Constants ¶ This section is empty. Variables ¶ This section is empty. Functions ¶ This section is empty. Types ¶ type TreeNode ¶ type TreeNode struct { Val int Left *TreeNode Right *TreeNode } * Definition for a binary tree node. type TreeNode struct { Val int Left *TreeNode Right *TreeNode } Source Files ¶ View all Source files findBottomLeftValue.go Click to show internal directories. Click to hide internal directories.