Java program to implement basic operations ( search , insert and delete ) on a BST that handles duplicates by storing count with every node
class GFG { static class node { int key ; int count ; node left , right ; } ;