//删除最小值 function delMinNode (root){
        if(!root) {
            return false;     }     var current = root;     if (current.left == null) {
            var rightNode = current.right;         return rightNode;     }     current.left = delMinNode(current.left);     return current.left; } //删除最大值 function delMaxNode (root) {
        if(!root) {
            return false;     }     var current = root;     if(current.right == null) {
            var leftNode = current.left;         return leftNode;     }     current.right = delMaxNode(current.right)     return current.right; } 利用递归找到最小的节点，判断最小的节点有没有子节点，把最小节点的子节点赋值给其父节点成为新的子节点