Rust: binary tree lexically ordered

binary-tree-lexically-ordered.rs

fn insert(&mut self, data: &str) {
    if data < &self.payload {
        match self.left {
            Some(ref mut n) => n.insert(data),
            None => self.set_left(Self::new(data)),
        }
    } else {
        match self.right {
            Some(ref mut n) => n.insert(data),
            None => self.set_right(Self::new(data)),
        }
    }
}

...
fn main() {
    let mut root = Node::new("root");
    root.insert("one");
    root.insert("two");
    root.insert("four");

    println!("root {:#?}", root);
}

Output result:

root Node {
    payload: "root",
    left: Some(
        Node {
            payload: "one",
            left: Some(
                Node {
                    payload: "four",
                    left: None,
                    right: None
                }
            ),
            right: None
        }
    ),
    right: Some(
        Node {
            payload: "two",
            left: None,
            right: None
        }
    )
}