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

/// The `BinaryTree` struct is a binary tree that can be used to store
/// Data is layed out in a Option Box Stucture
/// Option: Because a node can be null/none
/// Box for recursive data structure
/// ```
///
/// use algotrees::binary_trees::{initialize, prelude::BinaryTree};
/// let tree: BinaryTree<i32> =
///     initialize::create(5, None, Some(Box::new(initialize::create(6, None, None))));
///
/// assert_eq!(
///     tree,
///     BinaryTree {
///         head: 5,
///         left: None,
///         right: Some(Box::new(BinaryTree {
///             head: 6,
///             left: None,
///             right: None
///         }))
///     }
/// )
/// ```
#[derive(Default, Debug)]
pub struct BinaryTree<T> {
    pub head: T,
    pub left: Option<Box<BinaryTree<T>>>,
    pub right: Option<Box<BinaryTree<T>>>,
}