mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 00:06:28 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
40 lines
No EOL
1.1 KiB
Rust
40 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);
|
|
} |