https://leetcode-cn.com/problems/invert-binary-tree/
递归即可
中序遍历不行,因为左右结点在交换之后会重复
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return root;
sawp(root);
invertTree(root.left);
invertTree(root.right);
return root;
}
public void sawp(TreeNode root){
TreeNode temp;
temp = root.left;
root.left = root.right;
root.right = temp;
}
}