@Override
    public void delete(K k) {
        // this is the same implementation as other BST provided with small change i.e. decrement
        // node counter if it is more than one otherwise remove it.
    }
This is another version of binary search tree with support of duplicates.
Idea: store extra variable that counts the number of duplicates in each node.
src/ds/BSTWithDuplicate.java