JavaScript program to implement basic operations ( search , insert and delete ) on a BST that handles duplicates by storing count with every node
class node { constructor ( ) { this . key = 0 ; this . count = 0 ; this . left = null ; this . right = null ; } }