标签:Node 03 遍历 tree right let 二叉树 new Rust
环境
- Time 2022-04-21
- Rust 1.60.0
前言
说明
基于标准库来学习各种数据结构,并不是从头实现数据结构,未考虑实现性能。
实现了二叉树的前序、中序和后序遍历的测试。
示例
测试模块
mod tests {
use super::*;
use crate::tree::Node;
}
前序遍历
#[test]
fn 前序遍历() {
let mut tree = BinaryTree::default();
let left = Node::new_node_ref(44);
let right = Node::new_node_ref(55);
tree.root = Some(Box::new(Node {
value: 33,
left,
right,
}));
assert_eq!(tree.pre_order(), vec![&33, &44, &55])
}
中序遍历
#[test]
fn 中序遍历() {
let mut tree = BinaryTree::default();
let left = Node::new_node_ref(44);
let right = Node::new_node_ref(55);
tree.root = Some(Box::new(Node {
value: 33,
left,
right,
}));
assert_eq!(tree.in_order(), vec![&44, &33, &55])
}
后序遍历
#[test]
fn 后序遍历() {
let mut tree = BinaryTree::default();
let left = Node::new_node_ref(44);
let right = Node::new_node_ref(55);
tree.root = Some(Box::new(Node {
value: 33,
left,
right,
}));
assert_eq!(tree.post_order(), vec![&44, &55, &33])
}
测试
running 3 tests
test tree::binary_tree::tests::中序遍历 ... ok
test tree::binary_tree::tests::前序遍历 ... ok
test tree::binary_tree::tests::后序遍历 ... ok
test result: ok. 3 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
Doc-tests game
running 0 tests
test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
总结
测试了二叉树的前序、中序和后序遍历方法。
附录
源码
#[cfg(test)]
mod tests {
use super::*;
use crate::tree::Node;
#[test]
fn 前序遍历() {
let mut tree = BinaryTree::default();
let left = Node::new_node_ref(44);
let right = Node::new_node_ref(55);
tree.root = Some(Box::new(Node {
value: 33,
left,
right,
}));
assert_eq!(tree.pre_order(), vec![&33, &44, &55])
}
#[test]
fn 中序遍历() {
let mut tree = BinaryTree::default();
let left = Node::new_node_ref(44);
let right = Node::new_node_ref(55);
tree.root = Some(Box::new(Node {
value: 33,
left,
right,
}));
assert_eq!(tree.in_order(), vec![&44, &33, &55])
}
#[test]
fn 后序遍历() {
let mut tree = BinaryTree::default();
let left = Node::new_node_ref(44);
let right = Node::new_node_ref(55);
tree.root = Some(Box::new(Node {
value: 33,
left,
right,
}));
assert_eq!(tree.post_order(), vec![&44, &55, &33])
}
}
标签:Node,03,遍历,tree,right,let,二叉树,new,Rust 来源: https://www.cnblogs.com/jiangbo4444/p/16536134.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。