翻转二叉树

yingl · yingl · commit 8db25f003197 · 2016-08-04T13:49:02.000+08:00
diff --git a/invert_binary_tree.py b/invert_binary_tree.py
@@ -0,0 +1,12 @@
+# -*- coding: utf-8 -*-
+
+class Solution:
+    # @param root: a TreeNode, the root of the binary tree
+    # @return: nothing
+    def invertBinaryTree(self, root):
+        # write your code here
+        if root is None:
+            return
+        root.left, root.right = root.right, root.left
+        self.invertBinaryTree(root.left)
+        self.invertBinaryTree(root.right)
