private void delete ( RootListNode < K , V > n ) { RootListNode < K , V > nPrev = n . prev ; if ( nPrev != null ) { nPrev . next = n . next ; } else { rootList . head = n . next ; } if ( n . next != null ) { n . next . prev = nPrev ; } else { rootList . tail = nPrev ; } n . prev = null ; n . next = null ; }
Delete a node from the root list .