leetcode 226. Invert Binary Tree (python)

题目

Invert a binary tree.（具体题目参考leetcode官网）

解法1：利用递归(recursive)

递归的将每个节点的左右节点调换

形式1

class Solution(object):
    def invertTree(self, root):
        """
        :type root: TreeNode
        :rtype: TreeNode
        """
        def invert(node):
            if not node:
                return 
            node.left,node.