有时候宏观考虑一下,不要太钻牛角尖,尤其是递归问题,狠狠收获捏
ACcode:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
dfs(root);
return root;
}
private void dfs(TreeNode root) {
if (root==null) return ;
TreeNode right = invertTree(root.right);
TreeNode left = invertTree(root.left);
root.left=right;
root.right=left;
}
}
over~