Function main

code/chapter07/binary_tree.rs:124–150

()

}

fn main() {
    let mut bt = BinaryTree::new('a');

    let root = bt.get_key();
    println!("root val is {:?}", root);

    bt.insert_left_tree('b');
    bt.insert_right_tree('c');

    let left = bt.get_left();
    println!("left child is {:#?}", left);
    let right = bt.get_left();
    println!("right child is {:#?}", right);

    bt.preorder();
    bt.inorder();
    bt.postorder();

    let nk = Some(Box::new(bt));

    preorder(nk.clone());
    inorder(nk.clone());
    postorder(nk.clone());

    let tree_str = get_exp(nk);
    println!("String expr is {tree_str}");
}