Struct Node

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

A tree node

Implementations

impl<T> Node<T>

pub fn new(data: T) -> Self

Create a Node

Examples found in repository

examples/hello.rs (line 24)

fn main() {

    let mut root = HellNode::new(NodeData::new(0, format!("root")));

    root.data().print();

    let mut level1_0 = HellNode::new(NodeData::new(1, format!("level1_0")));
    let mut level1_1 = HellNode::new(NodeData::new(2, format!("level1_1")));

    let level2_0_0 = HellNode::new(NodeData::new(3, format!("level2_0_0")));
    let level2_0_1 = HellNode::new(NodeData::new(4, format!("level2_0_1")));

    level1_0.add(level2_0_0);
    level1_0.add(level2_0_1);

    let level2_1_0 = HellNode::new(NodeData::new(3, format!("level2_1_0")));

    
    level1_1.add(level2_1_0);

    root.add(level1_0);
    root.add(level1_1);

    root.deepth_first_search(|nd| nd.print());

    root.breadth_first_search(|nd| nd.print());
}

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

Add a node to self

Examples found in repository

examples/hello.rs (line 34)

fn main() {

    let mut root = HellNode::new(NodeData::new(0, format!("root")));

    root.data().print();

    let mut level1_0 = HellNode::new(NodeData::new(1, format!("level1_0")));
    let mut level1_1 = HellNode::new(NodeData::new(2, format!("level1_1")));

    let level2_0_0 = HellNode::new(NodeData::new(3, format!("level2_0_0")));
    let level2_0_1 = HellNode::new(NodeData::new(4, format!("level2_0_1")));

    level1_0.add(level2_0_0);
    level1_0.add(level2_0_1);

    let level2_1_0 = HellNode::new(NodeData::new(3, format!("level2_1_0")));

    
    level1_1.add(level2_1_0);

    root.add(level1_0);
    root.add(level1_1);

    root.deepth_first_search(|nd| nd.print());

    root.breadth_first_search(|nd| nd.print());
}

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

Get mut data

pub fn data(&self) -> &T

Get data

Examples found in repository

examples/hello.rs (line 26)

fn main() {

    let mut root = HellNode::new(NodeData::new(0, format!("root")));

    root.data().print();

    let mut level1_0 = HellNode::new(NodeData::new(1, format!("level1_0")));
    let mut level1_1 = HellNode::new(NodeData::new(2, format!("level1_1")));

    let level2_0_0 = HellNode::new(NodeData::new(3, format!("level2_0_0")));
    let level2_0_1 = HellNode::new(NodeData::new(4, format!("level2_0_1")));

    level1_0.add(level2_0_0);
    level1_0.add(level2_0_1);

    let level2_1_0 = HellNode::new(NodeData::new(3, format!("level2_1_0")));

    
    level1_1.add(level2_1_0);

    root.add(level1_0);
    root.add(level1_1);

    root.deepth_first_search(|nd| nd.print());

    root.breadth_first_search(|nd| nd.print());
}

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 last_child_by_level(&self, level: usize) -> Option<&Node<T>>

get right child by deepth

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

get right mut child by deepth

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

Deepth first traversal (Preorder) of a tree

Examples found in repository

examples/hello.rs (line 45)

fn main() {

    let mut root = HellNode::new(NodeData::new(0, format!("root")));

    root.data().print();

    let mut level1_0 = HellNode::new(NodeData::new(1, format!("level1_0")));
    let mut level1_1 = HellNode::new(NodeData::new(2, format!("level1_1")));

    let level2_0_0 = HellNode::new(NodeData::new(3, format!("level2_0_0")));
    let level2_0_1 = HellNode::new(NodeData::new(4, format!("level2_0_1")));

    level1_0.add(level2_0_0);
    level1_0.add(level2_0_1);

    let level2_1_0 = HellNode::new(NodeData::new(3, format!("level2_1_0")));

    
    level1_1.add(level2_1_0);

    root.add(level1_0);
    root.add(level1_1);

    root.deepth_first_search(|nd| nd.print());

    root.breadth_first_search(|nd| nd.print());
}

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

Breadth first traversal (Level Order) of a tree

Examples found in repository

examples/hello.rs (line 47)

fn main() {

    let mut root = HellNode::new(NodeData::new(0, format!("root")));

    root.data().print();

    let mut level1_0 = HellNode::new(NodeData::new(1, format!("level1_0")));
    let mut level1_1 = HellNode::new(NodeData::new(2, format!("level1_1")));

    let level2_0_0 = HellNode::new(NodeData::new(3, format!("level2_0_0")));
    let level2_0_1 = HellNode::new(NodeData::new(4, format!("level2_0_1")));

    level1_0.add(level2_0_0);
    level1_0.add(level2_0_1);

    let level2_1_0 = HellNode::new(NodeData::new(3, format!("level2_1_0")));

    
    level1_1.add(level2_1_0);

    root.add(level1_0);
    root.add(level1_1);

    root.deepth_first_search(|nd| nd.print());

    root.breadth_first_search(|nd| nd.print());
}