mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 15:46:29 +08:00
590b532606
* ✨ feat(rust/hashing): add array_hash_map * 📃 docs(rust/hashing): correct comments * ✨ feat(rust/include): add tree_node * ✨ feat(rust/include): add print_tree * ✨ feat(rust/tree): add binary_tree * docs(rust/tree): correct comments * 📃 docs(rust/tree): correct comments
39 lines
No EOL
1.1 KiB
Rust
39 lines
No EOL
1.1 KiB
Rust
/**
|
|
* File: binary_tree.rs
|
|
* Created Time: 2023-02-27
|
|
* Author: xBLACKICEx (xBLACKICE@outlook.com)
|
|
*/
|
|
|
|
use std::rc::Rc;
|
|
include!("../include/include.rs");
|
|
use tree_node::TreeNode;
|
|
|
|
/* Driver Code */
|
|
fn main() {
|
|
// 初始化二叉树
|
|
let n1 = TreeNode::new(1);
|
|
let n2 = TreeNode::new(2);
|
|
let n3 = TreeNode::new(3);
|
|
let n4 = TreeNode::new(4);
|
|
let n5 = TreeNode::new(5);
|
|
// 构建引用指向（即指针）
|
|
n1.borrow_mut().left = Some(Rc::clone(&n2));
|
|
n1.borrow_mut().right = Some(Rc::clone(&n3));
|
|
n2.borrow_mut().left = Some(Rc::clone(&n4));
|
|
n2.borrow_mut().right = Some(Rc::clone(&n5));
|
|
println!("\n初始化二叉树\n");
|
|
print_util::print_tree(&n1);
|
|
|
|
// 插入节点与删除节点
|
|
let p = TreeNode::new(0);
|
|
// 在 n1 -> n2 中间插入结点 P
|
|
p.borrow_mut().left = Some(Rc::clone(&n2));
|
|
n1.borrow_mut().left = Some(Rc::clone(&p));
|
|
println!("\n插入结点 P 后\n");
|
|
print_util::print_tree(&n1);
|
|
// 删除结点 P
|
|
drop(p);
|
|
n1.borrow_mut().left = Some(Rc::clone(&n2));
|
|
println!("\n删除结点 P 后\n");
|
|
print_util::print_tree(&n1);
|
|
} |