leetcode 226: Invert Binary Tree

最新推荐文章于 2023-01-12 10:53:59 发布

xudli

最新推荐文章于 2023-01-12 10:53:59 发布

阅读量5.1k

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/46554861

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Invert Binary Tree

Total Accepted: 11286 Total Submissions: 32033

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.

[思路]

递归交换左右子树

[CODE]

/**
 * 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) {
        if(root==null) return null;
        
        TreeNode temp  = root.left;
        root.left = root.right;
        root.right = temp;
        
        invertTree(root.left);
        invertTree(root.right);
        
        return root;    
    }
    
}