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.
95 lines
2.5 KiB
95 lines
2.5 KiB
/*
|
|
* File: tree_node.rs
|
|
* Created Time: 2023-02-27
|
|
* Author: xBLACKICEx (xBLACKICE@outlook.com), night-cruise (2586447362@qq.com)
|
|
*/
|
|
|
|
use std::cell::RefCell;
|
|
use std::rc::Rc;
|
|
|
|
/* 二叉树节点类型 */
|
|
#[derive(Debug)]
|
|
pub struct TreeNode {
|
|
pub val: i32,
|
|
pub height: i32,
|
|
pub parent: Option<Rc<RefCell<TreeNode>>>,
|
|
pub left: Option<Rc<RefCell<TreeNode>>>,
|
|
pub right: Option<Rc<RefCell<TreeNode>>>,
|
|
}
|
|
|
|
impl TreeNode {
|
|
/* 构造方法 */
|
|
pub fn new(val: i32) -> Rc<RefCell<Self>> {
|
|
Rc::new(RefCell::new(Self {
|
|
val,
|
|
height: 0,
|
|
parent: None,
|
|
left: None,
|
|
right: None,
|
|
}))
|
|
}
|
|
}
|
|
|
|
#[macro_export]
|
|
macro_rules! op_vec {
|
|
( $( $x:expr ),* ) => {
|
|
vec![
|
|
$( Option::from($x).map(|x| x) ),*
|
|
]
|
|
};
|
|
}
|
|
|
|
// 序列化编码规则请参考：
|
|
// https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
|
|
// 二叉树的数组表示：
|
|
// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
|
|
// 二叉树的链表表示：
|
|
// /——— 15
|
|
// /——— 7
|
|
// /——— 3
|
|
// | \——— 6
|
|
// | \——— 12
|
|
// ——— 1
|
|
// \——— 2
|
|
// | /——— 9
|
|
// \——— 4
|
|
// \——— 8
|
|
|
|
/* 将列表反序列化为二叉树：递归 */
|
|
fn vec_to_tree_dfs(arr: &[Option<i32>], i: usize) -> Option<Rc<RefCell<TreeNode>>> {
|
|
if i >= arr.len() || arr[i].is_none() {
|
|
return None;
|
|
}
|
|
let root = TreeNode::new(arr[i].unwrap());
|
|
root.borrow_mut().left = vec_to_tree_dfs(arr, 2 * i + 1);
|
|
root.borrow_mut().right = vec_to_tree_dfs(arr, 2 * i + 2);
|
|
Some(root)
|
|
}
|
|
|
|
/* 将列表反序列化为二叉树 */
|
|
pub fn vec_to_tree(arr: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
|
|
vec_to_tree_dfs(&arr, 0)
|
|
}
|
|
|
|
/* 将二叉树序列化为列表：递归 */
|
|
fn tree_to_vec_dfs(root: Option<Rc<RefCell<TreeNode>>>, i: usize, res: &mut Vec<Option<i32>>) {
|
|
if root.is_none() {
|
|
return;
|
|
}
|
|
let root = root.unwrap();
|
|
// i + 1 is the minimum valid size to access index i
|
|
while res.len() < i + 1 {
|
|
res.push(None);
|
|
}
|
|
res[i] = Some(root.borrow().val);
|
|
tree_to_vec_dfs(root.borrow().left.clone(), 2 * i + 1, res);
|
|
tree_to_vec_dfs(root.borrow().right.clone(), 2 * i + 2, res);
|
|
}
|
|
|
|
/* 将二叉树序列化为列表 */
|
|
pub fn tree_to_vec(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Option<i32>> {
|
|
let mut res = vec![];
|
|
tree_to_vec_dfs(root, 0, &mut res);
|
|
res
|
|
}
|