A binary search tree with insert - non self balancing

binarySearchTree

class node {
    value: any
    left: any
    right: any
    height: number
    balanceFactor(){
        var bf = (this.right.height) - (this.left.height);

    }
    constructor(v,h) {
        this.value = v;
        this.height = h;
    }
}

class bst {
    root: any

    addValue(v) {
       
        if (!this.root) {
            this.root = new node(v,0);
            return;
        }
        var currentNode = this.root;
        var height = 0;
        while (currentNode) {
            height++;
            if (v < currentNode.value) {
                if (!currentNode.left) {
                    currentNode.left =  new node(v,height);
                    break;
                } else {
                    currentNode = currentNode.left;
                }
            } else {
                if (!currentNode.right) {
                    currentNode.right = new node(v,height);
                    break;
                } else {
                    currentNode = currentNode.right;
                }
            }
        }

    }

}

Typescript Implementation of a binary search tree - insertion only