题目描述:翻转一棵二叉树
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/invert-binary-tree
var invertTree = function(root) {
if(!root)
return root;
let left = root.left;
let right = root.right;
left && invertTree(left);
right && invertTree(right);
root.left = right;
root.right = left;
return root;
};