https://leetcode-cn.com/problems/invert-binary-tree/
思路
递归调用翻转当前节点的左节点和翻转当前节点的右节点
调用完成后, 再翻转当前节点的左右节点
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
TreeNode left = invertTree(root.left);
TreeNode right = invertTree(root.right);
root.right = left;
root.left = right;
return root;
}