Struct common_tree::Node

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

A tree node

Implementations

impl<T> Node<T>

pub fn new(data: T) -> Self

Create a Node

pub fn add(&mut self, node: Node<T>)

Add a node to self

pub fn data_mut(&mut self) -> &mut T

Get mut data

pub fn data(&self) -> &T

Get data

pub fn child(&self, index: usize) -> Option<&Node<T>>

Get child by index

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

Get last child

pub fn child_mut(&mut self, index: usize) -> Option<&mut Node<T>>

Get mut child by index

pub fn last_child_mut(&mut self) -> Option<&mut Node<T>>

Get last mut child

pub fn children(&self) -> &Vec<Node<T>>

Get children

pub fn children_mut(&mut self) -> &mut Vec<Node<T>>

Get mut children

pub fn child_by_path(&self, path: &Vec<usize>) -> Option<&Node<T>>

Get child by a vec path path: [0, 1, 3]

pub fn child_mut_by_path(&mut self, path: &Vec<usize>) -> Option<&mut Node<T>>

Get mut child by a vec path path: [0, 1, 3]

pub fn deepth_first_search<F: FnMut(&T)>(&self, f: F)

Deepth first traversal (Preorder) of a tree

pub fn breadth_first_search<F: FnMut(&T)>(&self, f: F)

Breadth first traversal (Level Order) of a tree