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

Fix a comment in binary_search_tree code

Browse Source
This commit is contained in:
krahets 2023-05-17 19:04:46 +08:00
parent 26cc480ff5
commit 817b4598d5
10 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -89,7 +89,7 @@ void insert(binarySearchTree *bst, int num) {
cur = cur->left; cur = cur->left;
} }
} }
// 插入节点 val // 插入节点
TreeNode *node = newTreeNode(num); TreeNode *node = newTreeNode(num);
if (pre->val < num) { if (pre->val < num) {
pre->right = node; pre->right = node;

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

@ -77,7 +77,7 @@ class BinarySearchTree {
else else
cur = cur->left; cur = cur->left;
} }
// 插入节点 val // 插入节点
TreeNode *node = new TreeNode(num); TreeNode *node = new TreeNode(num);
if (pre->val < num) if (pre->val < num)
pre->right = node; pre->right = node;

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

@ -63,7 +63,7 @@ class BinarySearchTree {
else cur = cur.left; else cur = cur.left;
} }
// 插入节点 val // 插入节点
TreeNode node = new TreeNode(num); TreeNode node = new TreeNode(num);
if (pre != null) { if (pre != null) {
if (pre.val < num) pre.right = node; if (pre.val < num) pre.right = node;

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

@ -70,7 +70,7 @@ void insert(int num) {
else else
cur = cur.left; cur = cur.left;
} }
// 插入节点 val // 插入节点
TreeNode? node = TreeNode(num); TreeNode? node = TreeNode(num);
if (pre!.val < num) if (pre!.val < num)
pre.right = node; pre.right = node;

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

@ -74,7 +74,7 @@ class BinarySearchTree {
else else
cur = cur.left; cur = cur.left;
} }
// 插入节点 val // 插入节点
TreeNode node = new TreeNode(num); TreeNode node = new TreeNode(num);
if (pre.val < num) if (pre.val < num)
pre.right = node; pre.right = node;

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

@ -66,7 +66,7 @@ function insert(num) {
// 插入位置在 cur 的左子树中 // 插入位置在 cur 的左子树中
else cur = cur.left; else cur = cur.left;
} }
// 插入节点 val // 插入节点
let node = new TreeNode(num); let node = new TreeNode(num);
if (pre.val < num) pre.right = node; if (pre.val < num) pre.right = node;
else pre.left = node; else pre.left = node;

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

@ -77,7 +77,7 @@ class BinarySearchTree:
else: else:
cur = cur.left cur = cur.left
# 插入节点 val # 插入节点
node = TreeNode(num) node = TreeNode(num)
if pre.val < num: if pre.val < num:
pre.right = node pre.right = node

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

@ -80,7 +80,7 @@ class BinarySearchTree {
cur = cur?.left cur = cur?.left
} }
} }
// 插入节点 val // 插入节点
let node = TreeNode(x: num) let node = TreeNode(x: num)
if pre!.val < num { if pre!.val < num {
pre?.right = node pre?.right = node

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

@ -71,7 +71,7 @@ function insert(num: number): void {
cur = cur.left as TreeNode; // 插入位置在 cur 的左子树中 cur = cur.left as TreeNode; // 插入位置在 cur 的左子树中
} }
} }
// 插入节点 val // 插入节点
let node = new TreeNode(num); let node = new TreeNode(num);
if (pre!.val < num) { if (pre!.val < num) {
pre!.right = node; pre!.right = node;

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

@ -87,7 +87,7 @@ pub fn BinarySearchTree(comptime T: type) type {
cur = cur.?.left; cur = cur.?.left;
} }
} }
// 插入节点 val // 插入节点
var node = try self.mem_allocator.create(inc.TreeNode(T)); var node = try self.mem_allocator.create(inc.TreeNode(T));
node.init(num); node.init(num);
if (pre.?.val < num) { if (pre.?.val < num) {