码迷,mamicode.com
首页 > 其他好文 > 详细

Invert Binary Tree

时间:2015-06-18 09:47:06      阅读:180      评论: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.

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




Invert Binary Tree

标签:

原文地址:http://blog.csdn.net/guorudi/article/details/46539275

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!