Struct BST

pub struct BST<T>(/* private fields */);

BinarySearchTree

This crate implements a Binary Search Tree data structure with insert, preorder traversal, search and validate algorithms.

Implementations

impl<T> BST<T>

pub fn new() -> Self

Create a new BinarySearchTree

Example

use flex_algo::BST;
 
let mut bst = BST::new();
bst.insert(3);
bst.insert(2);
bst.insert(1);
 

impl<T> BST<T>

where T: PartialOrd + Copy,

pub fn insert(&mut self, data: T) -> bool

Insert into a new BinarySearchTree

Example

use flex_algo::BST;
 
let mut bst = BST::new();
bst.insert(3);
bst.insert(2);
bst.insert(1);
 

pub fn is_valid(&self, min: T, max: T) -> bool

Validate a new BinarySearchTree

Example

use flex_algo::BST;
 
let mut bst = BST::new();
bst.insert(3);
bst.insert(2);
bst.insert(1);
 
let is_valid = bst.is_valid(i32::MIN, i32::MAX);
assert_eq!(is_valid, true);
 

pub fn search(&self, data: T) -> Option<T>

Search a new BinarySearchTree

Example

use flex_algo::BST;
 
let mut bst = BST::new();
bst.insert(3);
bst.insert(2);
bst.insert(1);
 
let none = bst.search(5);
assert_eq!(none, None);
 
let found = bst.search(2);
assert_eq!(found, Some(2));
 

impl<T: Debug> BST<T>

pub fn print_preorder(&self, depth: i32)

Traversal a new BinarySearchTree preorder

Example

use flex_algo::BST;
 
let mut bst = BST::new();
bst.insert(3);
bst.insert(2);
bst.insert(1);
 
bst.print_preorder(0);
 

Trait Implementations

impl<T: Debug> Debug for BST<T>

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

Formats the value using the given formatter.