您的位置:首页 > 其它

leetCode之翻转二叉树

2015-06-18 21:52 405 查看


Invert Binary Tree

Total Accepted: 11046 Total
Submissions: 31299My Submissions

Question
Solution

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) {

if(root == null)

{

return null;

}

root.left = invertTree(root.left);

root.right = invertTree(root.right);

TreeNode tmp = root.left;

root.left = root.right;

root.right = tmp;

return root;

}

}

解题思路为:翻转二叉树的左右子树

然后将二叉树的左右子树交换
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: