common tree 树结构

通用树结构库，实现了深度遍历（先序遍历）和广度优先遍历

用法

更多可以查看examples

use common_tree::Node;

struct NodeData {
    id: usize,
    name: String,
}

impl NodeData {
    pub fn new(id: usize, name: String) -> Self {
        Self {
            id,
            name,
        }
    }

    pub fn print(&self) {
        println!("id: {}, name: {}", self.id, self.name);
    }
}
type HellNode = Node<NodeData>;

fn main() {

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

    root.data().print();

}

运行示例

cargo run --example hello

lib.rs:

通用树结构库 common tree 数据结构