1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
use std::{cell::RefCell, rc::Rc};
#[derive(Debug, PartialEq, Eq)]
pub struct TreeNode {
pub val: i32,
pub left: Option<Rc<RefCell<TreeNode>>>,
pub right: Option<Rc<RefCell<TreeNode>>>,
}
impl TreeNode {
#[inline]
pub fn new(val: i32) -> Self {
TreeNode { val, left: None, right: None }
}
pub fn from_vec(vec: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
use std::collections::VecDeque;
let root = Some(Rc::new(RefCell::new(TreeNode::new(vec[0].unwrap()))));
let mut queue = VecDeque::new();
queue.push_back(root.as_ref().unwrap().clone());
for children in vec[1..].chunks(2) {
let parent = queue.pop_front().unwrap();
if let Some(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 {
if let Some(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());
}
}
}
root
}
}
#[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<_>>();
TreeNode::from_vec(vec)
}
};
($($e:expr,)*) => {(tree![$($e),*])};
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_from_vec() {
let tree = tree![4, 2, 7, 1, 3, 6, 9];
println!("{:?}", tree);
assert_eq!(None::<Option<Rc<RefCell<TreeNode>>>>, tree![]);
}
}