Binary Search Tree Insertion (Implementation)

insert(newValue) {
    if(this.root==null){
        this.root=new Node(newValue);
        return;
    }
    //starting from the root
    var currentNode = this.root;
    var parent;
    //while we get to the null node  
    while (currentNode) {
        parent = currentNode; //update the parent
        if (newValue < currentNode.val) {
            //if newValue < currentNode.val, 
            //iterate to the left subtree
            currentNode = currentNode.leftChild
        } else {
            //if newValue >= currentNode.val, 
            //iterate to the right subtree
            currentNode = currentNode.rightChild;
        }
    }
    //by now, we will have the parent of the null
    //node where we have to insert the newValue 
    if (newValue < parent.val) {
        //if newValue < parent.val
        //insert into the leftChild
        parent.leftChild = new Node(newValue)
    } else {
        //if newValue >= parent.val
        //insert into the rightChild
        parent.rightChild = new Node(newValue)
    }
}