feat(go): support basic pkg

codes/go/chapter_tree/binary_search_tree.go

@@ -0,0 +1,20 @@
+// File: binary_search_tree.go
+// Created Time: 2022-11-25
+// Author: Reanon (793584285@qq.com)
+
+package chapter_tree
+
+import (
+	. "github.com/krahets/hello-algo/pkg"
+	"sort"
+)
+
+type BinarySearchTree struct {
+	root *TreeNode
+}
+
+func NewBinarySearchTree(nums []int) *BinarySearchTree {
+	// 排序数组
+	sort.Ints(nums)
+	return nil
+}

codes/go/chapter_tree/binary_tree.go

@@ -0,0 +1,23 @@
+// 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)
+}

codes/go/chapter_tree/binary_tree_test.go

@@ -0,0 +1,40 @@
+// File: binary_tree_test.go
+// Created Time: 2022-11-25
+// Author: Reanon (793584285@qq.com)
+
+package chapter_tree
+
+import (
+	. "github.com/krahets/hello-algo/pkg"
+	"testing"
+)
+
+func TestBinaryTree(t *testing.T) {
+	/* 初始化二叉树 */
+	// 初始化节点
+	n1 := NewTreeNode(1)
+	n2 := NewTreeNode(2)
+	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()
+
+	/* 插入与删除结点 */
+	p := NewTreeNode(0)
+	n1.Left = p
+	p.Left = n2
+	t.Log("插入结点 P 后")
+	tree.Print()
+
+	// 删除结点
+	n1.Left = n2
+	t.Log("删除结点 P 后")
+	tree.Print()
+}