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

# Change Log for AlgoTrees

This change log provides an overview of the changes made to the AlgoTrees project, including potential impact on existing projects.

## Jun 24, 2023

These changes were implemented to better reflect the purpose and implementation of each function. Please note that these are **VERY** breaking changes and should be adopted only after making appropriate adjustments to accommodate these changes.

### Algorithms Module

- Updated `get_left()` ⟶ `get_far_left()` to maintain clarity and reduce conflict between modules. **Breaking Change**
- Updated `get_right()` ⟶ `get_far_right()` to maintain clarity and reduce conflict between modules. **Breaking Change**
- Updated Algorithms Module to include `width()`, `get_far_left()`, `get_far_right()` as dot functions. **Breaking Change**

### Actions Module

- Updated `get_right()` ⟶ `get_right_node()` to better reflect the function's purpose. **Breaking Change**
- Updated `get_left()` ⟶ `get_left_node()` to better reflect the function's purpose. **Breaking Change**
- Updated `get_left_val()` ⟶ `get_left_head_val()` to better reflect the function's purpose and reduce conflict between modules. **Breaking Change**
- Updated `get_right_val()` ⟶ `get_right_head_val()` to better reflect the function's purpose and reduce conflict between modules. **Breaking Change**