Enum structures::tree::Tree

pub enum Tree<T> {
    Empty,
    Branch(T, Box<Self>, Box<Self>),
}

Binary Tree

Examples

use structures::tree::{TraverseOrder, Tree};

let tree = Tree::branch(1, Tree::leaf(2), Tree::leaf(3));

println!("{:#?}", tree);

println!("{:?}", tree.iter(TraverseOrder::InOrder).collect::<Vec<_>>());

Variants

EmptyBranch(T, Box<Self>, Box<Self>)

Methods

impl<T> Tree<T>

pub fn empty() -> Self

pub fn leaf(v: T) -> Self

pub fn branch(v: T, l: Self, r: Self) -> Self

pub fn left(&self) -> Option<&Self>

pub fn right(&self) -> Option<&Self>

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

pub fn iter(&self, order: TraverseOrder) -> impl Iterator<Item = &T>

pub fn traverse(&self, order: TraverseOrder, f: &mut dyn FnMut(&T))

Trait Implementations

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

fn eq(&self, other: &Tree<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Tree<T>) -> bool

This method tests for !=.

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

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

Formats the value using the given formatter.