【Leetcode-easy-226】Invert Binary Tree

最新推荐文章于 2024-03-26 03:41:38 发布

LYZ0907

最新推荐文章于 2024-03-26 03:41:38 发布

阅读量699

点赞数 1

分类专栏： Leetcode LeetCode 文章标签： Leetcode

本文链接：https://blog.csdn.net/liyazhou0215/article/details/78237294

版权

Leetcode 同时被 2 个专栏收录

50 篇文章 2 订阅

订阅专栏

LeetCode

50 篇文章 1 订阅

订阅专栏

【Leetcode-easy-226】Invert Binary Tree

题目

Invert a binary tree.

     4
   /   \
  2     7
 / \   / \
1   3 6   9

     4
   /   \
  7     2
 / \   / \
9   6 3   1

Trivia:
This problem was inspired by this original tweet by Max Howell:
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.

思路

递归

和剑指offer 面试题19 二叉树的镜像基本一样。

程序

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    public TreeNode invertTree(TreeNode root) {
        mirrorTree(root);
        return root;
    }

    private void mirrorTree(TreeNode root) {
        if (root == null) return;

        TreeNode tmp = root.left;
        root.left = root.right;
        root.right = tmp;

        mirrorTree(root.left);
        mirrorTree(root.right);
    }
}

声明：题目来自Leetcode。