You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
40 lines
1.1 KiB
40 lines
1.1 KiB
7 months ago
|
/**
|
||
|
|
* 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);
|
||
|
|
}
|