/binary_search_tree

Binary search tree implementation in Rust

Primary LanguageRustMIT LicenseMIT

binary_search_tree

Description

A classic Binary Search Tree written in Rust.

In this implementation, each node of the binary tree contains only one valuable value. To order the nodes, the elements must implement the Ord trait.

Usage

As a library

extern crate binary_search_tree;

use binary_search_tree::BinarySearchTree;

Features & capabilities

The BinarySearchTree struct provides the following methods:

If you have any comments or suggestions, or you suddenly found an error, please write to prototyperailgun@gmail.com.