leecode-二叉树系列翻转二叉树226-递归法平衡二叉树

翻转二叉树226-递归法

var invertTree = function(root) {    if(root !== null){        var temp;        temp = root.left;        root.left = root.right;        root.right = temp;        invertTree(root.left);        invertTree(root.right);    }    return root;};

平衡二叉树

var isBalanced = function (root) {    return balanced(root) != -1;};function balanced(node) {    if (!node) {        return 0;    }    const left = balanced(node.left);    const right = balanced(node.right);    if (left == -1 || right == -1 || Math.abs(left - right) > 1) {        return -1;    }    return Math.max(left, right) + 1;}console.log(isBalanced(obj));