Function order

publication/code/chapter08/binary_tree.rs:379–399

()

    }

    fn order() {
        let mut bt = BinaryTree::new(10usize);
        bt.insert_left_tree(2usize);
        bt.insert_right_tree(18usize);

        println!("internal pre-in-post-level order:");
        bt.preorder();
        bt.inorder();
        bt.postorder();
        bt.levelorder();

        let nk = Some(Box::new(bt.clone()));
        println!("outside pre-in-post-level order:");
        preorder(nk.clone());
        inorder(nk.clone());
        postorder(nk.clone());
        levelorder(nk.clone());

        println!("internal exp: {}", bt.iexp());
        println!("outside exp: {}", oexp(nk));
    }
}