rustgym 0.2.0

rustgym solutions
Documentation 
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

struct Solution;
use rustgym_util::*;

trait Postorder {
    fn postorder(self, target: i32) -> Self;
}

impl Postorder for TreeLink {
    fn postorder(self, target: i32) -> Self {
        if let Some(node) = self {
            let val = node.borrow().val;
            let left = node.borrow_mut().left.take();
            let right = node.borrow_mut().right.take();
            let left = left.postorder(target);
            let right = right.postorder(target);
            if left.is_none() && right.is_none() && val == target {
                None
            } else {
                tree!(val, left, right)
            }
        } else {
            None
        }
    }
}

impl Solution {
    fn remove_leaf_nodes(root: TreeLink, target: i32) -> TreeLink {
        root.postorder(target)
    }
}

#[test]
fn test() {
    let root = tree!(1, tree!(2, tree!(2), None), tree!(3, tree!(2), tree!(4)));
    let target = 2;
    let res = tree!(1, None, tree!(3, None, tree!(4)));
    assert_eq!(Solution::remove_leaf_nodes(root, target), res);
    let root = tree!(1, tree!(3, tree!(3), tree!(2)), tree!(3));
    let target = 3;
    let res = tree!(1, tree!(3, None, tree!(2)), None);
    assert_eq!(Solution::remove_leaf_nodes(root, target), res);
    let root = tree!(1, tree!(2, tree!(2, tree!(2), None), None), None);
    let target = 2;
    let res = tree!(1);
    assert_eq!(Solution::remove_leaf_nodes(root, target), res);
}