SOURCE

class Node{
    constructor(data,left=null,right=null){
        this.data=data
        this.left=left
        this.right=right
    }
}




class BST{
    constructor(){
        this.root=null
    }
    
    
    add(data){
        const node=this.root
        if(node===null){
            this.root=new Node(data)
            return
        }else{
            const searchTree=function(node){
                if(data<node.data){
                    if(node.left===null){
                        node.left=new Node(data)
                        return
                    }else if(node.left!==null){
                        return searchTree(node.left)
                    }
                }else if (data>node.data){
                    if(node.right===null){
                        node.right=new Node(data)
                        return
                    }else if(node.right!==null){
                     return searchTree(node.right)
                    }
                }  else{
                    return null
                }
                }
                return searchTree(node)
            }
        }

 

        finMin(){
            let current=this.root
            while(current.left!==null) {
                current=current.left
            }
            return current.data
        }



        finMax(){
            let current=this.root
            while(current.right!==null){
                current=current.right
            }
            return current.data
        }



        find(data){
            let current=this.root
            while(current.data!==data){
                if(data<current.data){
                    current=current.left
                }else{
                    current=current.right
                }
                if(current===null){
                    return null
                }
            }
            return current
        }



        isPresent(data){
            let current=this.root
            while(current){
                if(data===current.data){
                    return true
                }
                if(data<current.data){
                    current=current.left
                }else{
                    current=current.right
                }
            }
            return false
        }



         remove(data){
             const removeNode=function(node,data){
                 if(node===null){
                     return null
                 }
                 if(data===node.data){
                     if(node.left===null&&node.right===null){
                         return null
                     }
                     if(node.left===null){
                         return node.right
                     }
                     if(node.right===null){
                         return node.left
                     }
                     var tempNode=node.right
                     while(node.left!==null){
                         tempNode=tempNode.left
                     }
                     node.data=tempNode.data
                     node.right=removeNode(node.right,tempNode.data)
                     return node
                 }else if(data<node.data){
                     node.left=removeNode(node.left,data)
                     return node
                 }else{
                     node.right=removeNode(node.right,data)
                     return node
                 }
             }
             this.root=removeNode(this.root,data)
         }

    }

    const bst=new BST()
    bst.add(4958)
    bst.add(94783)
    bst.add(342)
    bst.add(4)
    bst.add(233)
    bst.add(876)
    bst.add(87)
    bst.remove(4)
    console.log(bst.finMin())
    console.log(bst.finMax())
    bst.remove(94783)
    console.log(bst.finMax())
    console.log(bst.isPresent(87))