class Solution {
public TreeNode invertTree(TreeNode root) {
if(root==null)return null;
invertTree(root.left);
invertTree(root.right);
TreeNode temp=root.left;
root.left=root.right;
root.right=temp;
return root;
}
}
力扣226翻转二叉树
最新推荐文章于 2024-05-21 20:32:24 发布