algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 06:07:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #189 from guowei-gong/binary_search_tree

Browse Source 
test(binary_search_tree): update test param
This commit is contained in:
Yudong Jin
2023-01-10 13:30:46 +08:00
committed by GitHub
parent a86bdeb7cd daa28be3e4
commit 0f14877b71
7 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/cpp/chapter_tree/binary_search_tree.cpp
View File

@ -133,7 +133,7 @@ int main() {
PrintUtil::printTree(bst->getRoot());
/* 查找结点 */
TreeNode* node = bst->search(5);
TreeNode* node = bst->search(7);
cout << endl << "查找到的结点对象为 " << node << "，结点值 = " << node->val << endl;
/* 插入结点 */

2
codes/csharp/chapter_tree/binary_search_tree.cs
View File

@ -159,7 +159,7 @@ namespace hello_algo.chapter_tree
PrintUtil.PrintTree(bst.getRoot());
/* 查找结点 */
TreeNode? node = bst.search(5);
TreeNode? node = bst.search(7);
Console.WriteLine("\n查找到的结点对象为 " + node + "，结点值 = " + node.val);
/* 插入结点 */

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

@ -20,8 +20,8 @@ func TestBinarySearchTree(t *testing.T) {
fmt.Println("\n二叉树的根结点为:", node.Val)
// 查找结点
node = bst.search(5)
fmt.Println("\n查找到的结点对象为", node, "，结点值 =", node.Val)
node = bst.Search(7)
fmt.Println("查找到的结点对象为", node, "，结点值 =", node.Val)
// 插入结点
node = bst.insert(16)

2
codes/java/chapter_tree/binary_search_tree.java
View File

@ -131,7 +131,7 @@ public class binary_search_tree {
PrintUtil.printTree(bst.getRoot());
/* 查找结点 */
TreeNode node = bst.search(5);
TreeNode node = bst.search(7);
System.out.println("\n查找到的结点对象为 " + node + "，结点值 = " + node.val);
/* 插入结点 */

2
codes/javascript/chapter_tree/binary_search_tree.js
View File

@ -126,7 +126,7 @@ console.log("\n初始化的二叉树为\n");
printTree(getRoot());
/* 查找结点 */
let node = search(5);
let node = search(7);
console.log("\n查找到的结点对象为 " + node + "，结点值 = " + node.val);
/* 插入结点 */

2
codes/python/chapter_tree/binary_search_tree.py
View File

@ -142,7 +142,7 @@ if __name__ == "__main__":
print_tree(bst.root)
# 查找结点
node = bst.search(5)
node = bst.search(7)
print("\n查找到的结点对象为: {}，结点值 = {}".format(node, node.val))
# 插入结点

2
codes/typescript/chapter_tree/binary_search_tree.ts
View File

@ -150,7 +150,7 @@ console.log('\n初始化的二叉树为\n');
printTree(getRoot());
/* 查找结点 */
let node = search(5);
let node = search(7);
console.log('\n查找到的结点对象为 ' + node + '，结点值 = ' + node!.val);
/* 插入结点 */