熟悉树的递归操作,注意终止条件
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return root;
TreeNode tp = root.left;
root.left = invertTree(root.right);//return root of reverse lrChild
root.right = invertTree(tp);
return root;
}
}