If this is a leaf node , then check if it is closer than the closest so far
if ( root . left == null && root . right == null ) { if ( lev < ( minDist . minDis ) ) { minDist . minDis = lev ; } return ; }