ehlxr/hello-algo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix(tree): make go code as consistent as possible with java code

Browse Source
This commit is contained in:
reanon
2022-11-26 16:32:34 +08:00
parent e62d663630
commit 913cf38d0b
2 changed files with 6 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
codes/go/chapter_tree/binary_search_tree_test.go
View File

@@ -7,7 +7,7 @@ package chapter_tree
import "testing"
func TestBinarySearchTree(t *testing.T) {
nums := []int{8, 9, 10, 11, 12, 13, 14, 15, 1, 2, 3, 4, 5, 6, 7}
nums := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}
bst := NewBinarySearchTree(nums)
t.Log("初始化的二叉树为: ")
bst.Print()
@@ -32,9 +32,6 @@ func TestBinarySearchTree(t *testing.T) {
bst.Remove(1)
t.Log("删除结点 1 后的二叉树为: ")
bst.Print()
bst.Remove(12)
t.Log("删除结点 12 后的二叉树为: ")
bst.Print()
bst.Remove(2)
t.Log("删除结点 2 后的二叉树为: ")
bst.Print()