xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-13 04:10:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

Free memory after removing

Browse Source 
a node from a LinkedList or TreeNode.
This commit is contained in:
Yudong Jin
2023-01-02 19:53:55 +08:00
parent 6b02449f22
commit 410c5d6b62
20 changed files with 69 additions and 140 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/go/chapter_tree/binary_search_tree_test.go
+7 -10
View File
@@ -12,33 +12,30 @@ import (
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)
fmt.Println("初始化的二叉树为:")
fmt.Println("\n初始化的二叉树为:")
bst.Print()
// 获取根结点
node := bst.GetRoot()
fmt.Println("二叉树的根结点为:", node.Val)
// 获取最小的结点
node = bst.GetMin(bst.GetRoot())
fmt.Println("二叉树的最小结点为:", node.Val)
fmt.Println("\n二叉树的根结点为:", node.Val)
// 查找结点
node = bst.Search(5)
fmt.Println("查找到的结点对象为", node, "，结点值 =", node.Val)
fmt.Println("\n查找到的结点对象为", node, "，结点值 =", node.Val)
// 插入结点
node = bst.Insert(16)
fmt.Println("插入结点后 16 的二叉树为:")
fmt.Println("\n插入结点后 16 的二叉树为:")
bst.Print()
// 删除结点
bst.Remove(1)
fmt.Println("删除结点 1 后的二叉树为:")
fmt.Println("\n删除结点 1 后的二叉树为:")
bst.Print()
bst.Remove(2)
fmt.Println("删除结点 2 后的二叉树为:")
fmt.Println("\n删除结点 2 后的二叉树为:")
bst.Print()
bst.Remove(4)
fmt.Println("删除结点 4 后的二叉树为:")
fmt.Println("\n删除结点 4 后的二叉树为:")
bst.Print()
}