Deepest left leaf node in a binary tree

gistfile1.java

public class DeepestLeftLeafNodeFinder {
 
    Node deepestNode;
    int deepestNodeDepth;
 
    public Node findDeepestLeftLeafNode(Node root,boolean isLeftNode,int depth){
 
        if(isLeftNode){
            if(depth > deepestNodeDepth){
                deepestNode = root;
                deepestNodeDepth = depth;
            }
        }
 
        if(root.getLeft() != null){
            findDeepestLeftLeafNode(root.getLeft(),true,depth + 1);
        }
 
        if(root.getRight() != null){
            findDeepestLeftLeafNode(root.getRight(),false,depth+1);
        }
 
        return deepestNode;
    }
}