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
48
49

struct Solution;
use rustgym_util::*;

trait Inorder {
    fn inorder(self, nodes: &mut Vec<i32>);
    fn build(nodes: &[i32]) -> TreeLink;
}

impl Inorder for TreeLink {
    fn inorder(self, nodes: &mut Vec<i32>) {
        if let Some(node) = self {
            let mut node = node.borrow_mut();
            let val = node.val;
            let left = node.left.take();
            let right = node.right.take();
            left.inorder(nodes);
            nodes.push(val);
            right.inorder(nodes);
        }
    }
    fn build(nodes: &[i32]) -> TreeLink {
        let n = nodes.len();
        if n == 0 {
            None
        } else {
            let m = n / 2;
            tree!(
                nodes[m],
                TreeLink::build(&nodes[..m]),
                TreeLink::build(&nodes[m + 1..])
            )
        }
    }
}

impl Solution {
    fn balance_bst(root: TreeLink) -> TreeLink {
        let mut nodes: Vec<i32> = vec![];
        root.inorder(&mut nodes);
        TreeLink::build(&nodes)
    }
}

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