/
recursive.rs
45 lines (33 loc) · 1.2 KB
/
recursive.rs
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
use crate::data_structures::TreeNode;
pub struct Solution;
// ------------------------------------------------------ snip ------------------------------------------------------ //
use std::cell::RefCell;
use std::rc::Rc;
impl Solution {
fn postorder_traversal_helper(root: &Option<Rc<RefCell<TreeNode>>>, result: &mut Vec<i32>) {
if let Some(node) = root {
let node_ref = node.borrow();
Self::postorder_traversal_helper(&node_ref.left, result);
Self::postorder_traversal_helper(&node_ref.right, result);
result.push(node_ref.val);
}
}
pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
let mut result = Vec::new();
Self::postorder_traversal_helper(&root, &mut result);
result
}
}
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl super::Solution for Solution {
fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
Self::postorder_traversal(root)
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_solution() {
super::super::tests::run::<super::Solution>();
}
}