github_mirrors/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-02-03 07:01:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

test(binary_search_tree): update test param all the language

Browse Source 
use param value 7, not 5. function test param value with param value in example picture as same.
This commit is contained in:
龚国玮 2023-01-10 12:16:02 +08:00
parent a5e923a387
commit 96d54bff3a
6 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -131,7 +131,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

@ -163,7 +163,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);
/* 插入结点 */

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

@ -145,7 +145,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);
/* 插入结点 */