Struct BinarySearchTree

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

Implementations

impl<T: PartialOrd + Copy> BinarySearchTree<T>

pub fn new(v: T) -> BinarySearchTree<T>

Contructor creates BinarySearchTree root node

pub fn from(data: Vec<T>) -> BinarySearchTree<T>

Delegates tree building to BinarySearchTree::build_recursive() This sorts vector input and pass splice to tree builder.

pub fn build_recursive( data: &[T], start: isize, end: isize, ) -> Option<Box<BinarySearchTree<T>>>

Recursively builds tree maintaining BST properties. Uses O(n) time.

pub fn inorder(&self) -> Vec<T>

Inorder traverse tree which yields elements in sorted order. Uses O(n) time.

pub fn preorder(&self) -> Vec<T>

Traverse tree in preorder. Uses O(n) time.

pub fn height(&self) -> usize

Calculates tree maximum height Worst case O(n)

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

Inserts an element in a tree. Uses O(n) time.

pub fn exists(&self, val: T) -> bool

Checks if element exists in a tree. Uses O(n) time.

pub fn find_min(&self) -> T

Finds minimum element in a tree. Uses O(n) time.

pub fn find_max(&self) -> T

Finds maximum element in a tree. Uses O(n) time.

Trait Implementations

impl<'a, T> IntoIterator for &'a BinarySearchTree<T>

where T: PartialOrd + Copy,

Implement non-consumable IntoIterator for BinarySearchTree

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = BinarySearchTreeIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for BinarySearchTree<T>

where T: PartialOrd + Copy,

implement consumable IntoIterator for BinarySearchTree

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<<BinarySearchTree<T> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.