question: Node < K , V > findFirst ( ) { for ( ; ; ) { Node < K , V > b = head . node ; Node < K , V > n = b . next ; if ( n == null ) return null ; if ( n . value != null ) return n ; n . helpDelete ( b , n . next ) ; } }
target:  Specialized variant of findNode to get first valid node.