首页 > 其他 > 详细

226. Invert Binary Tree

时间:2019-04-18 13:26:30      阅读:118      评论:0      收藏:0      [点我收藏+]

Invert a binary tree.

Example:

Input:

     4
   /     2     7
 / \   / 1   3 6   9

Output:

     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 f*** off.

 

Runtime: 92 ms, faster than 96.94% of C# online submissions for Invert Binary Tree.
Memory Usage: 22.1 MB, less than 28.89% of C# online submissions for Invert Binary Tree.
  public TreeNode InvertTree(TreeNode root)
        {
            if (root == null)
            {
                return null;
            }

            var left = root.left;
            var right = root.right;
            if (left == null && right == null)
            {
                return root;
            }

            if (left != null)
            {
                root.right = InvertTree(left);
            }
            else
            {
                root.right = null;
            }

            if (right != null)
            {
                root.left = InvertTree(right);
            }
            else
            {
                root.left = null;
            }

            return root;
        }

 

226. Invert Binary Tree

原文:https://www.cnblogs.com/chucklu/p/10728996.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!