LeetCode Invert Binary Tree

最新推荐文章于 2023-06-25 16:30:01 发布

原创最新推荐文章于 2023-06-25 16:30:01 发布

· 343 阅读

0 ·

版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

46 篇文章

订阅专栏

# 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
        """
        stack = [root]
        while stack:
            t= stack.pop()
            if t:
                t.left,t.right = t.right,t.left
                stack.append(t.left)
                stack.append(t.right)
        return root

class Solution2(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

if __name__ == '__main__':
    root  = TreeNode(1)
    a = TreeNode(2)
    b = TreeNode(3)
    root.left=a
    root.right=b
    Solution().invertTree(root)
    print root.left.val,root.right.val