mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-27 12:01:49 +08:00
2778a6f9c7
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
55 lines
1.3 KiB
Go
55 lines
1.3 KiB
Go
// File: avl_tree_test.go
|
|
// Created Time: 2023-01-08
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_tree
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
. "github.com/krahets/hello-algo/pkg"
|
|
)
|
|
|
|
func TestAVLTree(t *testing.T) {
|
|
/* Please pay attention to how the AVL tree maintains balance after inserting nodes */
|
|
tree := newAVLTree()
|
|
/* Insert node */
|
|
// Delete nodes
|
|
testInsert(tree, 1)
|
|
testInsert(tree, 2)
|
|
testInsert(tree, 3)
|
|
testInsert(tree, 4)
|
|
testInsert(tree, 5)
|
|
testInsert(tree, 8)
|
|
testInsert(tree, 7)
|
|
testInsert(tree, 9)
|
|
testInsert(tree, 10)
|
|
testInsert(tree, 6)
|
|
|
|
/* Please pay attention to how the AVL tree maintains balance after deleting nodes */
|
|
testInsert(tree, 7)
|
|
|
|
/* Remove node */
|
|
// Delete node with degree 1
|
|
testRemove(tree, 8) // Delete node with degree 2
|
|
testRemove(tree, 5) // Remove node with degree 1
|
|
testRemove(tree, 4) // Remove node with degree 2
|
|
|
|
/* Search node */
|
|
node := tree.search(7)
|
|
fmt.Printf("\nFound node object is %#v, node value = %d \n", node, node.Val)
|
|
}
|
|
|
|
func testInsert(tree *aVLTree, val int) {
|
|
tree.insert(val)
|
|
fmt.Printf("\nAfter inserting node %d, AVL tree is \n", val)
|
|
PrintTree(tree.root)
|
|
}
|
|
|
|
func testRemove(tree *aVLTree, val int) {
|
|
tree.remove(val)
|
|
fmt.Printf("\nAfter removing node %d, AVL tree is \n", val)
|
|
PrintTree(tree.root)
|
|
}
|