invert_binary_tree

hitzzc · hitzzc · commit ffc0de7d068c · 2016-10-17T18:15:35.000+08:00
diff --git a/README.md b/README.md
@@ -182,6 +182,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [223. Rectangle Area](https://github.com/hitzzc/go-leetcode/tree/master/rectangle_area)
 #### [224. Basic Calculator](https://github.com/hitzzc/go-leetcode/tree/master/basic_calculator)
 #### [225. Implement Stack using Queues](https://github.com/hitzzc/go-leetcode/tree/master/implement_stack_using_queues)
+#### [226. Invert Binary Tree](https://github.com/hitzzc/go-leetcode/tree/master/invert_binary_tree)
 
 
 
diff --git a/invert_binary_tree/invert_binary_tree.go b/invert_binary_tree/invert_binary_tree.go
@@ -0,0 +1,17 @@
+package invert_binary_tree
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func invertTree(root *TreeNode) *TreeNode {
+	if root == nil {
+		return nil
+	}
+	root.Left, root.Right = root.Right, root.Left
+	invertTree(root.Right)
+	invertTree(root.Left)
+	return root
+}
