Add Go codes to docs, including

the chapter of stack and queue, the chapter of tree.
2022-12-03 20:25:24 +08:00
parent 1d9a076cdd
commit ebf9024136
41 changed files with 898 additions and 486 deletions
--- a/codes/go/chapter_tree/binary_search_tree.go
+++ b/codes/go/chapter_tree/binary_search_tree.go
@@ -53,7 +53,7 @@ func (bst *BinarySearchTree) GetInorderNext(node *TreeNode) *TreeNode {
 	return node
 }

-// Search node of binary search tree
+/* 查找结点 */
 func (bst *BinarySearchTree) Search(num int) *TreeNode {
 	node := bst.root
 	// 循环查找，越过叶结点后跳出
@@ -73,7 +73,7 @@ func (bst *BinarySearchTree) Search(num int) *TreeNode {
 	return node
 }

-// Insert node of binary search tree
+/* 插入结点 */
 func (bst *BinarySearchTree) Insert(num int) *TreeNode {
 	cur := bst.root
 	// 若树为空，直接提前返回
@@ -104,7 +104,7 @@ func (bst *BinarySearchTree) Insert(num int) *TreeNode {
 	return cur
 }

-// Remove node of binary search tree
+/* 删除结点 */
 func (bst *BinarySearchTree) Remove(num int) *TreeNode {
 	cur := bst.root
 	// 若树为空，直接提前返回
@@ -119,8 +119,8 @@ func (bst *BinarySearchTree) Remove(num int) *TreeNode {
 			break
 		}
 		prev = cur
-		// 待删除结点在右子树中
 		if cur.Val < num {
+			// 待删除结点在右子树中
 			cur = cur.Right
 		} else {
 			// 待删除结点在左子树中
@@ -146,8 +146,8 @@ func (bst *BinarySearchTree) Remove(num int) *TreeNode {
 		} else {
 			prev.Right = child
 		}
-
-	} else { // 子结点数为 2
+		// 子结点数为 2
+	} else {
 		// 获取中序遍历中待删除结点 cur 的下一个结点
 		next := bst.GetInorderNext(cur)
 		temp := next.Val
@@ -156,7 +156,6 @@ func (bst *BinarySearchTree) Remove(num int) *TreeNode {
 		// 将 next 的值复制给 cur
 		cur.Val = temp
 	}
-	// TODO: add error handler, don't return node
 	return cur
 }

--- a/codes/go/chapter_tree/binary_search_tree_test.go
+++ b/codes/go/chapter_tree/binary_search_tree_test.go
@@ -4,38 +4,41 @@

 package chapter_tree

-import "testing"
+import (
+	"fmt"
+	"testing"
+)

 func TestBinarySearchTree(t *testing.T) {
 	nums := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}
 	bst := NewBinarySearchTree(nums)
-	t.Log("初始化的二叉树为:")
+	fmt.Println("初始化的二叉树为:")
 	bst.Print()

 	// 获取根结点
 	node := bst.GetRoot()
-	t.Log("二叉树的根结点为:", node.Val)
+	fmt.Println("二叉树的根结点为:", node.Val)
 	// 获取最小的结点
 	node = bst.GetMin(bst.GetRoot())
-	t.Log("二叉树的最小结点为:", node.Val)
+	fmt.Println("二叉树的最小结点为:", node.Val)

 	// 查找结点
 	node = bst.Search(5)
-	t.Log("查找到的结点对象为", node, "，结点值 =", node.Val)
+	fmt.Println("查找到的结点对象为", node, "，结点值 =", node.Val)

 	// 插入结点
 	node = bst.Insert(16)
-	t.Log("插入结点后 16 的二叉树为:")
+	fmt.Println("插入结点后 16 的二叉树为:")
 	bst.Print()

 	// 删除结点
 	bst.Remove(1)
-	t.Log("删除结点 1 后的二叉树为:")
+	fmt.Println("删除结点 1 后的二叉树为:")
 	bst.Print()
 	bst.Remove(2)
-	t.Log("删除结点 2 后的二叉树为:")
+	fmt.Println("删除结点 2 后的二叉树为:")
 	bst.Print()
 	bst.Remove(4)
-	t.Log("删除结点 4 后的二叉树为:")
+	fmt.Println("删除结点 4 后的二叉树为:")
 	bst.Print()
 }
--- a/codes/go/chapter_tree/binary_tree.go
+++ b/codes/go/chapter_tree/binary_tree.go
@@ -1,23 +0,0 @@
-// File: binary_tree.go
-// Created Time: 2022-11-25
-// Author: Reanon (793584285@qq.com)
-
-package chapter_tree
-
-import (
-	. "github.com/krahets/hello-algo/pkg"
-)
-
-type BinaryTree struct {
-	root *TreeNode
-}
-
-func NewBinaryTree(node *TreeNode) *BinaryTree {
-	return &BinaryTree{
-		root: node,
-	}
-}
-
-func (tree *BinaryTree) Print() {
-	PrintTree(tree.root)
-}
--- a/codes/go/chapter_tree/binary_tree_bfs.go
+++ b/codes/go/chapter_tree/binary_tree_bfs.go
@@ -10,11 +10,10 @@ import (
 	. "github.com/krahets/hello-algo/pkg"
 )

-// levelOrder Breadth First Search
+/* 层序遍历 */
 func levelOrder(root *TreeNode) []int {
-	// Let container.list as queue
-	queue := list.New()
 	// 初始化队列，加入根结点
+	queue := list.New()
 	queue.PushBack(root)
 	// 初始化一个切片，用于保存遍历序列
 	nums := make([]int, 0)
--- a/codes/go/chapter_tree/binary_tree_bfs_test.go
+++ b/codes/go/chapter_tree/binary_tree_bfs_test.go
@@ -5,6 +5,7 @@
 package chapter_tree

 import (
+	"fmt"
 	"testing"

 	. "github.com/krahets/hello-algo/pkg"
@@ -14,10 +15,10 @@ func TestLevelOrder(t *testing.T) {
 	/* 初始化二叉树 */
 	// 这里借助了一个从数组直接生成二叉树的函数
 	root := ArrayToTree([]int{1, 2, 3, 4, 5, 6, 7})
-	t.Log("初始化二叉树: ")
+	fmt.Println("初始化二叉树: ")
 	PrintTree(root)

 	// 层序遍历
 	nums := levelOrder(root)
-	t.Log("层序遍历的结点打印序列 =", nums)
+	fmt.Println("层序遍历的结点打印序列 =", nums)
 }
--- a/codes/go/chapter_tree/binary_tree_dfs.go
+++ b/codes/go/chapter_tree/binary_tree_dfs.go
@@ -8,56 +8,37 @@ import (
 	. "github.com/krahets/hello-algo/pkg"
 )

-// preOrder 前序遍历
-func preOrder(root *TreeNode) (nums []int) {
-	var preOrderHelper func(node *TreeNode)
-	// 匿名函数
-	preOrderHelper = func(node *TreeNode) {
-		if node == nil {
-			return
-		}
-		// 访问优先级：根结点 -> 左子树 -> 右子树
-		nums = append(nums, node.Val)
-		preOrderHelper(node.Left)
-		preOrderHelper(node.Right)
+var nums []int
+
+/* 前序遍历 */
+func preOrder(node *TreeNode) {
+	if node == nil {
+		return
 	}
-	// 函数调用
-	preOrderHelper(root)
-	return
+	// 访问优先级：根结点 -> 左子树 -> 右子树
+	nums = append(nums, node.Val)
+	preOrder(node.Left)
+	preOrder(node.Right)
 }

-// inOrder 中序遍历
-func inOrder(root *TreeNode) (nums []int) {
-	var inOrderHelper func(node *TreeNode)
-	// 匿名函数
-	inOrderHelper = func(node *TreeNode) {
-		if node == nil {
-			return
-		}
-		// 访问优先级：左子树 -> 根结点 -> 右子树
-		inOrderHelper(node.Left)
-		nums = append(nums, node.Val)
-		inOrderHelper(node.Right)
+/* 中序遍历 */
+func inOrder(node *TreeNode) {
+	if node == nil {
+		return
 	}
-	// 函数调用
-	inOrderHelper(root)
-	return
+	// 访问优先级：左子树 -> 根结点 -> 右子树
+	inOrder(node.Left)
+	nums = append(nums, node.Val)
+	inOrder(node.Right)
 }

-// postOrder 后序遍历
-func postOrder(root *TreeNode) (nums []int) {
-	var postOrderHelper func(node *TreeNode)
-	// 匿名函数
-	postOrderHelper = func(node *TreeNode) {
-		if node == nil {
-			return
-		}
-		// 访问优先级：左子树 -> 右子树 -> 根结点
-		postOrderHelper(node.Left)
-		postOrderHelper(node.Right)
-		nums = append(nums, node.Val)
+/* 后序遍历 */
+func postOrder(node *TreeNode) {
+	if node == nil {
+		return
 	}
-	// 函数调用
-	postOrderHelper(root)
-	return
+	// 访问优先级：左子树 -> 右子树 -> 根结点
+	postOrder(node.Left)
+	postOrder(node.Right)
+	nums = append(nums, node.Val)
 }
--- a/codes/go/chapter_tree/binary_tree_dfs_test.go
+++ b/codes/go/chapter_tree/binary_tree_dfs_test.go
@@ -5,6 +5,7 @@
 package chapter_tree

 import (
+	"fmt"
 	"testing"

 	. "github.com/krahets/hello-algo/pkg"
@@ -14,18 +15,21 @@ func TestPreInPostOrderTraversal(t *testing.T) {
 	/* 初始化二叉树 */
 	// 这里借助了一个从数组直接生成二叉树的函数
 	root := ArrayToTree([]int{1, 2, 3, 4, 5, 6, 7})
-	t.Log("初始化二叉树: ")
+	fmt.Println("初始化二叉树: ")
 	PrintTree(root)

 	// 前序遍历
-	nums := preOrder(root)
-	t.Log("前序遍历的结点打印序列 =", nums)
+	nums = nil
+	preOrder(root)
+	fmt.Println("前序遍历的结点打印序列 =", nums)

 	// 中序遍历
-	nums = inOrder(root)
-	t.Log("中序遍历的结点打印序列 =", nums)
+	nums = nil
+	inOrder(root)
+	fmt.Println("中序遍历的结点打印序列 =", nums)

 	// 后序遍历
-	nums = postOrder(root)
-	t.Log("后序遍历的结点打印序列 =", nums)
+	nums = nil
+	postOrder(root)
+	fmt.Println("后序遍历的结点打印序列 =", nums)
 }
--- a/codes/go/chapter_tree/binary_tree_test.go
+++ b/codes/go/chapter_tree/binary_tree_test.go
@@ -5,6 +5,7 @@
 package chapter_tree

 import (
+	"fmt"
 	"testing"

 	. "github.com/krahets/hello-algo/pkg"
@@ -18,24 +19,23 @@ func TestBinaryTree(t *testing.T) {
 	n3 := NewTreeNode(3)
 	n4 := NewTreeNode(4)
 	n5 := NewTreeNode(5)
-
-	tree := NewBinaryTree(n1)
+	// 构建引用指向（即指针）
 	n1.Left = n2
 	n1.Right = n3
 	n2.Left = n4
 	n2.Right = n5
-	t.Log("初始化二叉树")
-	tree.Print()
+	fmt.Println("初始化二叉树")
+	PrintTree(n1)

 	/* 插入与删除结点 */
+	// 插入结点
 	p := NewTreeNode(0)
 	n1.Left = p
 	p.Left = n2
-	t.Log("插入结点 P 后")
-	tree.Print()
-
+	fmt.Println("插入结点 P 后")
+	PrintTree(n1)
 	// 删除结点
 	n1.Left = n2
-	t.Log("删除结点 P 后")
-	tree.Print()
+	fmt.Println("删除结点 P 后")
+	PrintTree(n1)
 }