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

Invert Binary Tree

时间:2015-10-20 15:19:13      阅读:113      评论:0      收藏:0      [点我收藏+]

标签:

https://leetcode.com/problems/invert-binary-tree/

Invert a binary tree.

     4
   /     2     7
 / \   / 1   3 6   9
to
     4
   /     7     2
 / \   / 9   6 3   1


直接用递归
# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def invertTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        if root:
            root.left,root.right = root.right,root.left
            self.invertTree(root.left)
            self.invertTree(root.right)
        return root
        

 

Invert Binary Tree

标签:

原文地址:http://www.cnblogs.com/jkmiao/p/4894847.html

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