就是递归
class Solution: # @param {TreeNode} root # @return {TreeNode} def invertTree(self, root): if not root: return root.left, root.right = root.right, root.left self.invertTree(root.left) self.invertTree(root.right) return root
原文：http://www.cnblogs.com/dapanshe/p/4625857.html