Python Algorithms

226. Invert Binary Tree.py

#
# 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 not root:
            return 
        
        root.left, root.right = root.right, root.left
        map(self.invertTree, (root.left,root.right))
                
        return root

226. txt

Change value use tuple.

Use map.