时间复杂度为O(n)
public TreeNode invertTree(TreeNode root) {
helper(root);
return root;
}
public void helper(TreeNode root){
if(root==null){
return;
}
//这和两个数交换大小差不多
TreeNode node=root.left;
root.left=root.right;
root.right=node;
helper(root.left);
helper(root.right);
}