Struct Tree

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

Implementations

impl<T: PartialOrd + Clone + PartialEq + Debug + Default> Tree<T>

pub fn new() -> Tree<T>

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

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

pub fn contains_key(&self, key: T) -> bool

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn clear(&mut self)

pub fn minimum(&self) -> Option<T>

pub fn maximum(&self) -> Option<T>

Trait Implementations

impl<T: Debug> Debug for Tree<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for Tree<T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.