algotrees 0.2.0

This is a VERY early stage project to implement a library of algorithms and data structures in Rust. It has very little features and only supports one data structure (binary trees) at the moment. Documentation will come after each portion of the project is done ie: documentation for the binary tree data structure will come once all of the algorithms and options you can use are implemented.
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

use crate::binary_trees::types::BinaryTree;

impl<T> BinaryTree<T>
where
    T: std::ops::Add<Output = T>
        + std::ops::Sub<Output = T>
        + std::cmp::PartialOrd
        + PartialEq
        + Default
        + Copy,
{
    pub fn width(&self) -> T {
        let left = self.get_far_left();
        let right = self.get_far_right();
        if left > right {
            return left - right;
        } else {
            return right - left;
        }
    }

    pub fn get_far_left(&self) -> T {
        if self.left.is_none() {
            return self.head;
        } else {
            return self.left.as_ref().unwrap().get_far_left();
        }
    }

    pub fn get_far_right(&self) -> T {
        if self.right.is_none() {
            return self.head;
        } else {
            return self.right.as_ref().unwrap().get_far_right();
        }
    }

    pub fn exists(&self, target: T) -> bool {
        if self.head == target {
            return true;
        }

        self.left.as_ref().map_or(false, |left| left.exists(target))
            || self
                .right
                .as_ref()
                .map_or(false, |right| right.exists(target))
    }
}