Struct BinarySearchTree 

pub struct BinarySearchTree<K: Ord + Debug, V> { /* private fields */ }

A professional-grade, zero-dependency Binary Search Tree (BST) data structure.

Note: This is a simple binary search tree and is not self-balancing. Performance may degrade to O(n) in worst-case scenarios with already sorted data.

Panics

This implementation will panic if it encounters a key already in the tree. This is not ideal, and a more robust implementation would return a Result.

Implementations

impl<K: Ord + Debug, V> BinarySearchTree<K, V>

pub fn new() -> Self

Creates a new empty Binary Search Tree.

pub fn insert(&mut self, key: K, value: V) -> Result<(), BinarySearchTreeError>

Inserts a key-value pair into the tree.

Arguments

• key - The key to insert.
• value - The value associated with the key.

Returns

Ok(()) on success, or a BinarySearchTreeError if the key already exists.

pub fn search(&self, key: &K) -> Option<&V>

Searches for a key in the tree and returns a reference to its value.

Arguments

• key - The key to search for.

Returns

Some(&V) if the key is found, otherwise None.

Trait Implementations

impl<K: Debug + Ord + Debug, V: Debug> Debug for BinarySearchTree<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.