class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null)return root;
if(root.left == null && root.right == null )return root;
TreeNode left = invertTree(root.left);
TreeNode right = invertTree(root.right);
root.left = right;
root.right = left;
return root;
}
}
![<span style='color:red;'>力</span><span style='color:red;'>扣</span>每日一题day30[<span style='color:red;'>226</span>. <span style='color:red;'>翻转</span><span style='color:red;'>二</span><span style='color:red;'>叉</span><span style='color:red;'>树</span>]](https://img-blog.csdnimg.cn/img_convert/e6ff1b55c12e63879fafd5e17e22805c.jpeg)
