Function order

publication/code/chapter08/avl.rs:476–490

()

    }

    fn order() {
        let mut avl = AvlTree::new();
        for i in 0..5 { let (_r1, _r2) = avl.insert(i); }

        println!("internal pre-in-pos-level order");
        avl.preorder();
        avl.inorder();
        avl.postorder();
        avl.levelorder();
        println!("outside pre-in-pos-level order");
        preorder(&avl);
        inorder(&avl);
        postorder(&avl);
        levelorder(&avl);
    }
}