Struct tree::TreeNode

pub struct TreeNode<T: Copy> {
    pub value: T,
    pub left: Option<Box<TreeNode<T>>>,
    pub right: Option<Box<TreeNode<T>>>,
}

A node in a binary tree.

Can be used for many interesting algorithmic things.

Fields

value: T

left: Option<Box<TreeNode<T>>>

The left node, may be None.

right: Option<Box<TreeNode<T>>>

The right node, may be None.

Implementations

impl<T: Copy> TreeNode<T>

pub fn new(v: T) -> TreeNode<T>

Initialises a new node for a Tree.

pub fn reduce<R>(&self, reducer: fn(_: Option<R>, _: T, _: Option<R>) -> R) -> R

Recursively reduces each element in tree.

pub fn insert_left(&mut self, value: T)

Recursively inserts to the left of node until there is one empty space.

pub fn insert_right(&mut self, value: T)

Recursively inserts to the right of node until there is one empty space.

Trait Implementations

impl<T: Copy + Display> Display for TreeNode<T>

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

Formats the value using the given formatter.