Update result if this node is left leaf and its level is more than the maxl level of the current result
if ( isLeft != false && node . left == null && node . right == null && lvl > level . maxlevel ) { result = node ; level . maxlevel = lvl ; }