algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +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

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);
}