id_tree 0.2.12

A library for creating and modifying Tree structures.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

extern crate id_tree;

use id_tree::NodeId;
use id_tree::Node;
use id_tree::TreeBuilder;
use id_tree::Tree;

fn main() {
    let mut tree: Tree<i32> = TreeBuilder::new()
        .with_node_capacity(5)
        .build();

    let root_id: NodeId = tree.set_root(Node::new(0));
    let child_1_id: NodeId = tree.insert_with_parent(Node::new(1), &root_id).unwrap();
    tree.insert_with_parent(Node::new(2), &root_id).unwrap();
    tree.insert_with_parent(Node::new(3), &child_1_id).unwrap();
    tree.insert_with_parent(Node::new(4), &child_1_id).unwrap();

    println!("Post-order:");
    print_nodes_post_order(&tree, &root_id);
    println!("");
    println!("Pre-order:");
    print_nodes_pre_order(&tree, &root_id);
    println!("");
}

fn print_nodes_post_order(tree: &Tree<i32>, node_id: &NodeId) {
    let node_ref: &Node<i32> = tree.get(node_id).unwrap();

    for child_id in node_ref.children() {
        print_nodes_post_order(tree, &child_id);
    }

    print!("{}, ", node_ref.data());
}

fn print_nodes_pre_order(tree: &Tree<i32>, node_id: &NodeId) {
    let node_ref: &Node<i32> = tree.get(node_id).unwrap();

    print!("{}, ", node_ref.data());

    for child_id in node_ref.children() {
        print_nodes_pre_order(tree, &child_id);
    }
}