mirror of
https://github.com/krahets/hello-algo.git
synced 2025-10-31 10:26:48 +08:00
2a9db6d039
* Sync zh and zh-hant versions. * Remove the polyfill.io link from mkdocs.yml * Update contributors' info for code reviewers and en/zh-hant versions reviewers. * Fix graph.md * Update avatars for English version reviewers. * Sync zh and zh-hant versions. * Fix two_sum_brute_force.png * Sync zh and zh-hant versions. Optimize structrue of index.html. * Format index.html
39 lines
1.1 KiB
Rust
39 lines
1.1 KiB
Rust
/**
|
|
* File: binary_tree.rs
|
|
* Created Time: 2023-02-27
|
|
* Author: xBLACKICEx (xBLACKICE@outlook.com)
|
|
*/
|
|
use std::rc::Rc;
|
|
use hello_algo_rust::include::{print_util, 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);
|
|
}
|