diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
index 6c005191..bd3a9e1c 100644
--- a/problems/二叉树的递归遍历.md
+++ b/problems/二叉树的递归遍历.md
@@ -122,6 +122,58 @@ Python：
 
 Go：
 
+前序遍历:
+```
+func PreorderTraversal(root *TreeNode) (res []int) {
+	var traversal func(node *TreeNode)
+	traversal = func(node *TreeNode) {
+		if node == nil {
+			return
+		}
+		res = append(res,node.Val)
+		traversal(node.Left)
+		traversal(node.Right)
+	}
+	traversal(root)
+	return res
+}
+
+```
+中序遍历:
+
+```
+func InorderTraversal(root *TreeNode) (res []int) {
+	var traversal func(node *TreeNode)
+	traversal = func(node *TreeNode) {
+		if node == nil {
+			return
+		}
+		traversal(node.Left)
+		res = append(res,node.Val)
+		traversal(node.Right)
+	}
+	traversal(root)
+	return res
+}
+```
+后序遍历:
+
+```
+func PostorderTraversal(root *TreeNode) (res []int) {
+	var traversal func(node *TreeNode)
+	traversal = func(node *TreeNode) {
+		if node == nil {
+			return
+		}
+		traversal(node.Left)
+		traversal(node.Right)
+    res = append(res,node.Val)
+	}
+	traversal(root)
+	return res
+}
+```
+