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

[LeetCode]Invert Binary Tree

时间:2015-12-05 14:23:45      阅读:125      评论:0      收藏:0      [点我收藏+]

标签:

public class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        TreeNode tmp1 = root.left;
        TreeNode tmp2 = root.right;
        root.right = invertTree(tmp1);
        root.left = invertTree(tmp2);
        return root;
    }
}

 

[LeetCode]Invert Binary Tree

标签:

原文地址:http://www.cnblogs.com/vision-love-programming/p/5021424.html

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