Struct Node

pub struct Node<T> { /* private fields */ }

Node<T> represents the single node in a tree.

Implementations

impl<T: ItemType> Node<T>

pub fn new(item: Option<T>, count: usize) -> Node<T>

Create a new Node with the given item and count.

pub fn new_rc(item: Option<T>, count: usize) -> Rc<Node<T>>

Create a new Rc with the given item and count.

pub fn add_child(self: &Rc<Self>, child_node: Rc<Node<T>>)

Add the given child Node as a child of this node.

pub fn remove_child(self: &Rc<Self>, child_node: Rc<Node<T>>)

pub fn search(&self, item: T) -> Option<Rc<Node<T>>>

Check whether this node contains a child node for the given item. If so, that node’s reference is returned; otherwise, None is returned.

pub fn increment(&self, incr_count: usize)

Increment the count associated with this node’s item.

pub fn print(&self, depth: usize)

Print out the node.

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

pub fn count(&self) -> usize

Return the count value this node’s item holds.

pub fn neighbor(&self) -> Option<Rc<Node<T>>>

Return this node’s neighbor node.

pub fn parent(&self) -> Option<Rc<Node<T>>>

Return this node’s parent node.

pub fn is_root(&self) -> bool

Check whether this node is a root node.

pub fn is_leaf(&self) -> bool

Check whether this node is a leaf node.

Trait Implementations

impl<T: Debug> Debug for Node<T>

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

Formats the value using the given formatter.

impl<T: ItemType> PartialEq for Node<T>

fn eq(&self, other: &Node<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.