binary_tree_zy 0.1.2

a simple implementation for a binary tree
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

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


pub struct BinaryTree{
    val: i64,
    left: Option<Rc<RefCell<BinaryTree>>>,
    right: Option<Rc<RefCell<BinaryTree>>>
}

impl BinaryTree{
    pub fn new(val: i64)-> Option<Rc<RefCell<BinaryTree>>>{
        return 
            Some(Rc::new(
                RefCell::new(
                    BinaryTree{
                        val,
                        left: None,
                        right: None
                        }
                    )
                )
            )
    }

    pub fn insert_left(&mut self, left: Option<Rc<RefCell<BinaryTree>>>) {
      self.left = left;
    }

    pub fn insert_right(&mut self, right: Option<Rc<RefCell<BinaryTree>>>) {
      self.right = right; 
    }

    pub fn traverse(&self){
        print!("{:?}\n",self.val);
        match self.left.as_ref(){
            Some(left) =>{
                left.borrow().traverse();
            },
            None =>{ 
            }
        }
        match self.right.as_ref(){
            Some(right) =>{ 
                right.borrow().traverse();
            }
            None =>{
            }
        }
    }

    pub fn print2DUtil(&self, mut space: i64){
        space = space + 10;
        match self.right.as_ref(){
            Some(right) => {
                right.borrow().print2DUtil(space);
            }
            None => {

            }
        }
        
        println!();

        for i in 10..space{
            print!(" ")
        }
        println!("{:?}\n", self.val);
        match self.left.as_ref(){
            Some(left) => {
                left.borrow().print2DUtil(space);
            }
            None => {

            }
        }
    }
}


#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn it_works() {
        let a = BinaryTree::new(1);
        let b = BinaryTree::new(2);
        let c = BinaryTree::new(3);
        let d = BinaryTree::new(10);
        let mut a_ref = a.as_ref().unwrap().borrow_mut();
        a_ref.insert_left(b.clone());
        a_ref.insert_right(c.clone());
        b.as_ref().unwrap().borrow_mut().insert_left(d.clone());
        a_ref.traverse();
        drop(a_ref);
    }

    #[test]
    fn test_print2DUtil(){
        let a = BinaryTree::new(1);
        let b = BinaryTree::new(2);
        let c = BinaryTree::new(3);
        let d = BinaryTree::new(10);
        let mut a_ref = a.as_ref().unwrap().borrow_mut();
        a_ref.insert_left(b.clone());
        a_ref.insert_right(c.clone());
        b.as_ref().unwrap().borrow_mut().insert_left(d.clone());
        a_ref.print2DUtil(0);
    }
}