Binary Search Tree Insertion (Implementation)

void insertBST(int val) {
    if(getRoot()==NULL){
            root=new Node(val);
            return;
    }
    //starting from the root
    Node* currentNode = root;
    Node* parent;
    //while we get to the null node
    while (currentNode) {
        parent = currentNode; //update the parent
        if (val < currentNode->value) {
            //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 (val < parent->value) {
        //if newValue < parent.val
        //insert into the leftChild
        parent->leftChild = new Node(val);
    } else {
        //if newValue >= parent.val
        //insert into the rightChild
        parent->rightChild = new Node(val);
    }
}