js手写二叉排序树

二叉排序树:每个节点的左节点都比根节点小，右节点都比根节点大

function TreeNode(data, left, right) {
    //节点结构
    this.val = data;
    this.left = left;
    this.right = right;
}

function BST() {
    //二叉树构造函数
    this.root = null; //默认是一颗空树
    this.insert = function (data)