/**
* 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) {
TreeNode p = root;
if (p==null)
return p;
TreeNode tmp = invertTree(p.left);
p.left = invertTree(p.right);
p.right = tmp;
return p;
}
}
leetcode 226. Invert Binary Tree
最新推荐文章于 2023-11-10 09:55:35 发布