Trait Tree

pub trait Tree<T> {
    type Position;

    // Required methods
    fn children(&self, node: Self::Position) -> Option<Vec<Self::Position>>;
    fn get<'a>(&'a self, node: &'a Self::Position) -> Option<&'a T>;
    fn parent(&self, node: Self::Position) -> Option<Self::Position>;
    fn is_root(&self, node: Self::Position) -> bool;
    fn is_leaf(&self, node: Self::Position) -> bool;
    fn depth(&self, node: Self::Position) -> Option<usize>;
    fn height(&self, node: Self::Position) -> Option<usize>;
    fn num_children(&self, node: Self::Position) -> Option<usize>;
}

Defines the a basic Tree ADT where P is a position, and T is a type

Required Associated Types

type Position

Required Methods

fn children(&self, node: Self::Position) -> Option<Vec<Self::Position>>

Returns an iterable collection over the node’s children

NOTE: To make this iterable into an iterator simply call something like self.children(node).into_iter()

fn get<'a>(&'a self, node: &'a Self::Position) -> Option<&'a T>

Returns an immutable reference to the node’s data type

fn parent(&self, node: Self::Position) -> Option<Self::Position>

Returns the position of a node’s parent, if it exists

fn is_root(&self, node: Self::Position) -> bool

Returns true if the specified position is the tree’s root

fn is_leaf(&self, node: Self::Position) -> bool

Returns true if the specified position is external

fn depth(&self, node: Self::Position) -> Option<usize>

fn height(&self, node: Self::Position) -> Option<usize>

fn num_children(&self, node: Self::Position) -> Option<usize>

Returns the immediate number of children for a given node

Implementors

impl<T> Tree<T> for BinTree<T>

where T: Clone + PartialEq,

type Position = Box<Node<T>>