//刪除最小值
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;
}
//刪除最大值
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;
}
利用遞歸找到最小的節點，判斷最小的節點有沒有子節點，把最小節點的子節點賦值給其父節點成為新的子節點

js 二叉樹刪除最大值和最小值