A utility function to find deepest leaf node . lvl : level of current node . maxlvl : pointer to the deepest left leaf node found so far isLeft : A bool indicate that this node is left child of its parent resPtr : Pointer to the result
def deepestLeftLeafUtil ( root , lvl , maxlvl , isLeft ) : NEW_LINE