首页 > 其他 > 详细

leetcode-Invert Binary Tree

时间:2015-06-25 21:01:10      阅读:237      评论:0      收藏:0      [点我收藏+]

Invert a binary tree.

     4
   /     2     7
 / \   / 1   3 6   9

to

     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.
296ms,不过我觉得还是想试试其他的,比如说用stack,把2叉树先序存起来,然后倒序遍历二叉树的方式读出来,然而并没有什么暖用

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

leetcode-Invert Binary Tree

原文:http://www.cnblogs.com/puck/p/4600778.html

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