Struct BinarySearchTree 

pub struct BinarySearchTree<T> {
    pub root: Option<Box<Node<T>>>,
}

A binary search tree implementation

Fields

root: Option<Box<Node<T>>>

Implementations

impl<T: Ord + Debug> BinarySearchTree<T>

pub fn new() -> Self

Creates a new empty binary search tree

Examples found in repository

examples/basic.rs (line 5)

fn main() -> Result<(), Box<dyn std::error::Error>> {
    let mut tree = BinarySearchTree::new();
    for &value in &[8, 3, 10, 1, 6, 14, 4, 7, 13] {
        tree.insert(value);
    }

    let ascii = AsciiVisualizer;
    println!("ASCII Visualization:\n{}", ascii.visualize(&tree)?);

    let svg = SvgVisualizer::default();
    std::fs::write("example_tree.svg", svg.visualize(&tree)?)?;
    println!("SVG visualization has been saved to 'example_tree.svg'");

    Ok(())
}

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

Inserts a value into the tree

Examples found in repository

examples/basic.rs (line 7)

fn main() -> Result<(), Box<dyn std::error::Error>> {
    let mut tree = BinarySearchTree::new();
    for &value in &[8, 3, 10, 1, 6, 14, 4, 7, 13] {
        tree.insert(value);
    }

    let ascii = AsciiVisualizer;
    println!("ASCII Visualization:\n{}", ascii.visualize(&tree)?);

    let svg = SvgVisualizer::default();
    std::fs::write("example_tree.svg", svg.visualize(&tree)?)?;
    println!("SVG visualization has been saved to 'example_tree.svg'");

    Ok(())
}

pub fn height(&self) -> usize

Returns the height of the tree

pub fn inorder(&self) -> InOrderIterator<'_, T>

Returns an iterator over the tree nodes in-order

Trait Implementations

impl<T: Debug> Debug for BinarySearchTree<T>

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

Formats the value using the given formatter.