513. Find Bottom Left Tree Value

513. Find Bottom Left Tree Value

// mine : error ???
Line 25: error: cannot find symbol: variable cur

class Solution {
    public int findBottomLeftValue(TreeNode root) {
      Queue<TreeNode> queue = new LinkedList<>();
      queue.add(root);
      while (!queue.isEmpty()){
        TreeNode cur = queue.poll();
        if(cur.right != null){
          queue.add(cur.right);
        }
        if(cur.left != null){
          queue.add(cur.left);
        }
      }
      return cur.val;
    }
}



/// others accepted 
Java:

public int findLeftMostNode(TreeNode root) {
    Queue<TreeNode> queue = new LinkedList<>();
    queue.add(root);
    while (!queue.isEmpty()) {
        root = queue.poll();
        if (root.right != null)
            queue.add(root.right);
        if (root.left != null)
            queue.add(root.left);
    }
    return root.val;
}

 

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