bstree

A Binary Search Tree written in Rust

lib.rs:

This crate is a Rust implementation of the binary search tree data structure

The implementation requires the elements to implement the Ord trait, since a binary search tree expects to contain unique elements that can be compared.

It should be noted that the implementation consists of both recursive and iterative methods, and most likely not the most efficient ones out there (at least for now).