Struct BinTree

pub struct BinTree<T: PartialEq> { /* private fields */ }

The BinTree struct contains operations specific to binary trees.

NOTE: Requires the PartialEq trait bounds for binary tree operations

Implementations

impl<T> BinTree<T>

where T: PartialEq,

pub fn new() -> BinTree<T>

Creates a new generic binary tree.

pub fn add_left(&mut self, ancestor: Node<T>, node: Box<Node<T>>)

Adds a left node to a parent

pub fn add_right(&mut self, ancestor: Node<T>, node: Box<Node<T>>)

Adds a right node to a parent

pub fn set(&mut self, _p: Node<T>, _node: T) -> Result<(), String>

Overwrites the data at a given node (position) */

WARNING: Unimplmented

pub fn attach(&mut self, _left: Node<T>, _right: Node<T>)

WARNING: Unimplmented

pub fn remove(&mut self, p: Node<T>)

WARNING: Unimplmented

pub fn size(&self) -> usize

Returns the number of nodes in the tree

pub fn is_empty(&self) -> bool

Returns true if the tree contains no nodes

pub fn root(&self) -> Option<&Box<Node<T>>>

Returns an immutable reference to the root of the tree

Trait Implementations

impl<T> BinaryTree<T> for BinTree<T>

where T: Clone + PartialEq,

type Position = Box<Node<T>>

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

Returns the position of the left child of a given node

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

Returns the position of the right child of a given node

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

Returns the position of the sibling of a given node

impl<T> Default for BinTree<T>

where T: PartialEq,

fn default() -> Self

Returns the “default value” for a type.

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

where T: Clone + PartialEq,

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

Returns an immutable reference to the node’s data

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

Returns an immutable reference to the parent of the given node

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

Returns the number of children for a given node

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

Returns a collection of the node’s children

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

Returns true if the provided node has no children

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

Returns true if the node is the root

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

Depth…

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

Height…

type Position = Box<Node<T>>