Java | Leetcode Java题解之第226题翻转二叉树

阅读 30

2024-07-24

题目:

题解:

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return null;
        }
        TreeNode left = invertTree(root.left);
        TreeNode right = invertTree(root.right);
        root.left = right;
        root.right = left;
        return root;
    }
}

相关推荐

精彩评论(0)

0 0 举报