xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 15:36:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Merge branch 'krahets:master' into master

Browse source
This commit is contained in:
Daniel 2023-01-10 21:45:25 +11:00 committed by GitHub
commit 83ed991d40
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
7 changed files with 8 additions and 8 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

@ -133,7 +133,7 @@ int main() {
PrintUtil::printTree(bst->getRoot()); PrintUtil::printTree(bst->getRoot());
/* 查找结点 */ /* 查找结点 */
TreeNode* node = bst->search(5); TreeNode* node = bst->search(7);
cout << endl << "查找到的结点对象为 " << node << "，结点值 = " << node->val << endl; 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()); PrintUtil.PrintTree(bst.getRoot());
/* 查找结点 */ /* 查找结点 */
TreeNode? node = bst.search(5); TreeNode? node = bst.search(7);
Console.WriteLine("\n查找到的结点对象为 " + node + "，结点值 = " + node.val); 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) fmt.Println("\n二叉树的根结点为:", node.Val)
// 查找结点 // 查找结点
node = bst.search(5) node = bst.Search(7)
fmt.Println("\n查找到的结点对象为", node, "，结点值 =", node.Val) fmt.Println("查找到的结点对象为", node, "，结点值 =", node.Val)
// 插入结点 // 插入结点
node = bst.insert(16) 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()); PrintUtil.printTree(bst.getRoot());
/* 查找结点 */ /* 查找结点 */
TreeNode node = bst.search(5); TreeNode node = bst.search(7);
System.out.println("\n查找到的结点对象为 " + node + "，结点值 = " + node.val); 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()); printTree(getRoot());
/* 查找结点 */ /* 查找结点 */
let node = search(5); let node = search(7);
console.log("\n查找到的结点对象为 " + node + "，结点值 = " + node.val); 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) print_tree(bst.root)
# 查找结点 # 查找结点
node = bst.search(5) node = bst.search(7)
print("\n查找到的结点对象为: {}，结点值 = {}".format(node, node.val)) 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()); printTree(getRoot());
/* 查找结点 */ /* 查找结点 */
let node = search(5); let node = search(7);
console.log('\n查找到的结点对象为 ' + node + '，结点值 = ' + node!.val); console.log('\n查找到的结点对象为 ' + node + '，结点值 = ' + node!.val);
/* 插入结点 */ /* 插入结点 */