Adding a solution for interview prep delete leaf node

What is your hint or solution suggestion?

Challenge: Delete a Leaf Node in a Binary Search Tree

Link to the challenge:

Solution:

var displayTree = tree => console.log(JSON.stringify(tree, null, 2));
function Node(value) {
  this.value = value;
  this.left = null;
  this.right = null;
}

function BinarySearchTree() {
  this.root = null;

  this.remove = (val) => {
    if (!this.root) return null
    if (this.root.value === val) return this.root = null

    const find = (root) => {
      if (!root) return null
      if (val < root.value) {
        if (root.left && val === root.left.value) return root.left = null
        return find(root.left)
      }
      if (val > root.value) {
        if (root.right && val === root.right.value) return root.right = null
        return find(root.right)
      }
    }
    return find(this.root)
  }
}