Struct Tree

pub struct Tree<T> {
    pub root: Option<Rc<RefCell<Node<T>>>>,
}

Fields

root: Option<Rc<RefCell<Node<T>>>>

Implementations

impl<T> Tree<T>

where T: PartialOrd + Clone + Display,

pub fn new(val: T) -> Self

pub fn print(&self)

pub fn insert(&self, item: 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: &Tree<T>) -> 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.

impl<T: Eq> Eq for Tree<T>

impl<T> StructuralPartialEq for Tree<T>