tree.rs

use std::cell::RefCell;
use std::rc::Rc;

#[derive(Debug,PartialEq,Eq)]
pubstructTreeNode{
pubval:i32,
publeft:Option<Rc<RefCell<TreeNode>>>,
pubright:Option<Rc<RefCell<TreeNode>>>,
}

implTreeNode{
#[inline]
pubfnnew(val:i32) -> Self{
TreeNode{
 val,
left:None,
right:None,
}
}
}

pubfnto_tree(vec:Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>>{
use std::collections::VecDeque;
let head = Some(Rc::new(RefCell::new(TreeNode::new(vec[0].unwrap()))));
letmut queue = VecDeque::new();
 queue.push_back(head.as_ref().unwrap().clone());

for children in vec[1..].chunks(2){
let parent = queue.pop_front().unwrap();
ifletSome(v) = children[0]{
 parent.borrow_mut().left = Some(Rc::new(RefCell::new(TreeNode::new(v))));
 queue.push_back(parent.borrow().left.as_ref().unwrap().clone());
}
if children.len() > 1{
ifletSome(v) = children[1]{
 parent.borrow_mut().right = Some(Rc::new(RefCell::new(TreeNode::new(v))));
 queue.push_back(parent.borrow().right.as_ref().unwrap().clone());
}
}
}
 head
}

#[macro_export]
macro_rules! tree {
() => {
None
};
($($e:expr),*) => {
{
let vec = vec![$(stringify!($e)), *];
let vec = vec.into_iter().map(|v| v.parse::<i32>().ok()).collect::<Vec<_>>();
use std::collections::VecDeque;
let head = Some(Rc::new(RefCell::new(TreeNode::new(vec[0].unwrap()))));
letmut queue = VecDeque::new();
 queue.push_back(head.as_ref().unwrap().clone());

for children in vec[1..].chunks(2){
let parent = queue.pop_front().unwrap();
ifletSome(v) = children[0]{
 parent.borrow_mut().left = Some(Rc::new(RefCell::new(TreeNode::new(v))));
 queue.push_back(parent.borrow().left.as_ref().unwrap().clone());
}
if children.len() > 1{
ifletSome(v) = children[1]{
 parent.borrow_mut().right = Some(Rc::new(RefCell::new(TreeNode::new(v))));
 queue.push_back(parent.borrow().right.as_ref().unwrap().clone());
}
}
}
 head
}
};
($($e:expr,)*) => {(tree![$($e),*])};
}