Struct BinSearchTree

pub struct BinSearchTree<T> { /* private fields */ }

Implementations

impl<T> BinSearchTree<T>

where T: Ord,

pub fn new() -> Self

Creates a new, empty binary search tree.

pub fn new_with_capacity(size: usize) -> Self

Creates a new, empty binary search tree with a given (growable) initial capacity.

pub fn insert(&mut self, key: T)

Inserts the given key into the tree. New insertions in a simple BST are always leafs. This implementation does not guarantee uniqueness.

pub fn remove(&mut self, key: T) -> Option<T>

pub fn iter(&self) -> InOrderIter<'_, T>

Produces a “snapshot” iterator over immutable references to the tree in its current state.

Trait Implementations

impl<T: Debug> Debug for BinSearchTree<T>

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

Formats the value using the given formatter.

impl<T> Default for BinSearchTree<T>

where T: Ord,

fn default() -> Self

Returns the “default value” for a type.