CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-16 11:02:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

Replace "结点" with "节点".

Browse Source
This commit is contained in:
krahets
2023-10-27 23:24:13 +08:00
parent 7605cab160
commit 5385057993
7 changed files with 24 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/c/chapter_graph/graph_adjacency_list.c
View File

@@ -215,7 +215,7 @@ void removeVertex(GraphAdjList *graph, unsigned int index) {
printf("Out of range in %s:%d\n", __FILE__, __LINE__);
return;
}
// 遍历待删除顶点的链表，将所有与待删除结点有关的边删除
// 遍历待删除顶点的链表，将所有与待删除节点有关的边删除
Node *temp = vet->list->head->next;
while (temp != 0) {
removeLink(temp->val->list, vet); // 删除与该顶点有关的边

10
codes/rust/chapter_tree/binary_tree_bfs.rs
View File

@@ -12,19 +12,19 @@ use tree_node::{vec_to_tree, TreeNode};
/* 层序遍历 */
fn level_order(root: &Rc<RefCell<TreeNode>>) -> Vec<i32> {
// 初始化队列，加入根结点
// 初始化队列，加入根节点
let mut que = VecDeque::new();
que.push_back(Rc::clone(&root));
// 初始化一个列表，用于保存遍历序列
let mut vec = Vec::new();
while let Some(node) = que.pop_front() { // 队列出队
vec.push(node.borrow().val); // 保存结点值
vec.push(node.borrow().val); // 保存节点值
if let Some(left) = node.borrow().left.as_ref() {
que.push_back(Rc::clone(left)); // 左子结点入队
que.push_back(Rc::clone(left)); // 左子节点入队
}
if let Some(right) = node.borrow().right.as_ref() {
que.push_back(Rc::clone(right)); // 右子结点入队
que.push_back(Rc::clone(right)); // 右子节点入队
};
}
vec
@@ -40,5 +40,5 @@ fn main() {
/* 层序遍历 */
let vec = level_order(&root);
print!("\n层序遍历的结点打印序列 = {:?}", vec);
print!("\n层序遍历的节点打印序列 = {:?}", vec);
}

12
codes/rust/chapter_tree/binary_tree_dfs.rs
View File

@@ -15,7 +15,7 @@ fn pre_order(root: Option<&Rc<RefCell<TreeNode>>>) -> Vec<i32> {
let mut result = vec![];
if let Some(node) = root {
// 访问优先级：根结点 -> 左子树 -> 右子树
// 访问优先级：根节点 -> 左子树 -> 右子树
result.push(node.borrow().val);
result.append(&mut pre_order(node.borrow().left.as_ref()));
result.append(&mut pre_order(node.borrow().right.as_ref()));
@@ -28,7 +28,7 @@ fn in_order(root: Option<&Rc<RefCell<TreeNode>>>) -> Vec<i32> {
let mut result = vec![];
if let Some(node) = root {
// 访问优先级：左子树 -> 根结点 -> 右子树
// 访问优先级：左子树 -> 根节点 -> 右子树
result.append(&mut in_order(node.borrow().left.as_ref()));
result.push(node.borrow().val);
result.append(&mut in_order(node.borrow().right.as_ref()));
@@ -41,7 +41,7 @@ fn post_order(root: Option<&Rc<RefCell<TreeNode>>>) -> Vec<i32> {
let mut result = vec![];
if let Some(node) = root {
// 访问优先级：左子树 -> 右子树 -> 根结点
// 访问优先级：左子树 -> 右子树 -> 根节点
result.append(&mut post_order(node.borrow().left.as_ref()));
result.append(&mut post_order(node.borrow().right.as_ref()));
result.push(node.borrow().val);
@@ -59,13 +59,13 @@ fn main() {
/* 前序遍历 */
let vec = pre_order(root.as_ref());
println!("\n前序遍历的结点打印序列 = {:?}", vec);
println!("\n前序遍历的节点打印序列 = {:?}", vec);
/* 中序遍历 */
let vec = in_order(root.as_ref());
println!("\n中序遍历的结点打印序列 = {:?}", vec);
println!("\n中序遍历的节点打印序列 = {:?}", vec);
/* 后序遍历 */
let vec = post_order(root.as_ref());
print!("\n后序遍历的结点打印序列 = {:?}", vec);
print!("\n后序遍历的节点打印序列 = {:?}", vec);
}