LeetCode - Find Bottom Left Tree Value

/**
 * 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 {
    public int findBottomLeftValue(TreeNode root) {
        if (root == null) {
            return -1;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        int res = root.val;
        while (!queue.isEmpty()){
            TreeNode node = queue.poll();
            if(node.right != null) {
                res = node.right.val;
                queue.add(node.right);
            }
            if (node.left != null) {
                res = node.left.val;
                queue.add(node.left);
            }
        }
        return res;
        
    }
}

/**
 * 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 {
    int bottomLeft = 0;
    int maxDepth = -1;
    public int findBottomLeftValue(TreeNode root) {
        helper(root, -1);
        return bottomLeft;
    }
    private void helper (TreeNode node, int depthOfParent) {
        if (node == null) {
            return;
        }
        int curDepth = depthOfParent + 1;
        
        if (curDepth > maxDepth) {
            bottomLeft = node.val;
            maxDepth = curDepth;
        }
        
        helper(node.left, curDepth);
        helper(node.right, curDepth);
    }
}