Update result if this node is left leaf and its level is more than the maxl level of the current result
if ( isLeft && ! root -> left && ! root -> right && lvl > * maxlvl ) { * resPtr = root ; * maxlvl = lvl ; return ; }