leetcode-trees-rs 0.1.149

A Rust library for Tree Node LeetCode problems.
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
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

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

use crate::prelude::*;
use crate::utils::{symmetric_tree, TreeNode};

///////////////////////////////////////////////////////////////////////////////////////////////////
// Utility
///////////////////////////////////////////////////////////////////////////////////////////////////

fn rc_cell_node(val: i32) -> Rc<RefCell<TreeNode>> {
    Rc::from(RefCell::from(TreeNode::new(val)))
}

///////////////////////////////////////////////////////////////////////////////////////////////////
// Preset nodes
///////////////////////////////////////////////////////////////////////////////////////////////////

fn asymmetric_values_tree(left_val: i32, right_val: i32) -> TreeNode {
    let left_node = TreeNode::new(left_val);
    let right_node = TreeNode::new(right_val);
    TreeNode {
        val: 100,
        left: Some(Rc::from(RefCell::from(left_node))),
        right: Some(Rc::from(RefCell::from(right_node))),
    }
}

fn asymmetric_tree_no_right(val: i32) -> TreeNode {
    TreeNode {
        val: 100,
        left: Some(rc_cell_node(val)),
        right: None,
    }
}

fn asymmetric_tree_no_left(val: i32) -> TreeNode {
    TreeNode {
        val: 100,
        left: None,
        right: Some(rc_cell_node(val)),
    }
}

///////////////////////////////////////////////////////////////////////////////////////////////////
// Tests with the preset nodes
///////////////////////////////////////////////////////////////////////////////////////////////////

fn test_symmetric_tree() -> Result<()> {
    let symmetric_tree = symmetric_tree!(100, 50, 123, 124, 124, 1, 24, 12, 421, 41, 42, 14, 12, 4);

    match (symmetric_tree.left, symmetric_tree.right) {
        (Some(left_node), Some(right_node)) => {
            assert_eq!(left_node, right_node);
        }
        (Some(_), None) => {
            return Err("Missing right_node".into());
        }
        (None, Some(_)) => {
            return Err("Missing left_node".into());
        }
        _ => {
            return Err("Missing both left_node and right_node".into());
        }
    }

    Ok(())
}

fn test_asymmetric_values_tree() -> Result<()> {
    let left_val = 42;
    let right_val = 21;

    let asymmetric_tree = asymmetric_values_tree(left_val, right_val);

    match (asymmetric_tree.left, asymmetric_tree.right) {
        (Some(left_node), Some(right_node)) => {
            assert_eq!(left_node, rc_cell_node(left_val));
            assert_eq!(right_node, rc_cell_node(right_val));

            assert_ne!(left_node, right_node);
        }
        (Some(_), None) => {
            return Err("Missing right_node".into());
        }
        (None, Some(_)) => {
            return Err("Missing left_node".into());
        }
        _ => {
            return Err("Missing both left_node and right_node".into());
        }
    }

    Ok(())
}

fn test_asymmetric_depth_trees() -> Result<()> {
    let asymmetric_nodes_values = 50;

    let asymmetric_tree_no_right = asymmetric_tree_no_right(asymmetric_nodes_values);
    let asymmetric_tree_no_left = asymmetric_tree_no_left(asymmetric_nodes_values);

    match (
        asymmetric_tree_no_right.left,
        asymmetric_tree_no_right.right,
    ) {
        (Some(_), Some(_)) => {
            return Err("There shouldn't be a right_node".into());
        }
        (Some(left_node), None) => {
            assert_eq!(left_node, rc_cell_node(asymmetric_nodes_values));
        }
        (None, Some(_)) => {
            return Err("Missing left_node and there shouldn't be a right node".into());
        }
        _ => {
            return Err("There should just be a right_node but there're no nodes".into());
        }
    }

    match (asymmetric_tree_no_left.left, asymmetric_tree_no_left.right) {
        (Some(_), Some(_)) => {
            return Err("There shouldn't be a left_node".into());
        }
        (Some(_), None) => {
            return Err("Missing right_node and there shouldn't be a left node".into());
        }
        (None, Some(right_node)) => {
            assert_eq!(right_node, rc_cell_node(asymmetric_nodes_values));
        }
        _ => {
            return Err("There should just be a left_node but there're no nodes".into());
        }
    }

    Ok(())
}

///////////////////////////////////////////////////////////////////////////////////////////////////
// Main
///////////////////////////////////////////////////////////////////////////////////////////////////

#[test]
fn main() -> Result<()> {
    test_symmetric_tree()?;
    test_asymmetric_values_tree()?;
    test_asymmetric_depth_trees()?;
    Ok(())
}