Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3 Output: 1 Example 2: Input: 1 / \ 2 3 / / \ 4 5 6 / 7 Output: 7题目含义:给定一个二叉树,求最底层的最左边的值 1 public int findBottomLeftValue(TreeNode root) { 2 Queue<Tre…