hammy
/
bst-rs
mirror of https://github.com/sgoudham/bst-rs.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
Recursive & Iterative Binary Search Tree Implementations within Rust
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
25 Commits
1 Branch
0 Tags
140 KiB
Rust 100%
 
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '7ce3762ee9'
${ noResults }
Go to file
sgoudham 7ce3762ee9
Remove lib name 		3 years ago
src WIP iterative_consume_post_order_vec() + add some docs 3 years ago
tests Change test names 3 years ago
.gitignore Update .gitignore 3 years ago
Cargo.toml Remove lib name 3 years ago
LICENSE Initial commit 3 years ago
README.md Fix link 3 years ago

README.md

bst-rs

Recursive & Iterative Binary Search Tree Implementations within Rust

Table of Contents

Personal Goals

One of the main motivations for starting this is to fully grasp the following concepts

  • Ownership/Borrowing
  • Generic Traits
  • Lifetimes

I am now more confident programming around these concepts and can discuss and reason about different implementations.

Usage

TODO

License

MIT License

Inspiration

The book Learn Rust With Entirely Too Many Linked Lists inspired me to try and implement a Binary Search Trees within the language. I had also been wanting to create my first library for other crates to use.