| 459 | } |
| 460 | |
| 461 | fn main() { |
| 462 | basic(); |
| 463 | order(); |
| 464 | |
| 465 | fn basic() { |
| 466 | let mut t = AvlTree::new(); |
| 467 | for i in 0..5 { let (_r1, _r2) = t.insert(i); } |
| 468 | |
| 469 | println!("empty:{},size:{}",t.is_empty(),t.size()); |
| 470 | println!("leaves:{},depth:{}",t.leaf_size(),t.depth()); |
| 471 | println!("internals:{}", t.none_leaf_size()); |
| 472 | println!("min-max key:{:?}-{:?}",t.min(),t.max()); |
| 473 | println!("contains 9:{}",t.contains(&9)); |
| 474 | } |
| 475 | |
| 476 | fn order() { |
| 477 | let mut avl = AvlTree::new(); |
| 478 | for i in 0..5 { let (_r1, _r2) = avl.insert(i); } |
| 479 | |
| 480 | println!("internal pre-in-pos-level order"); |
| 481 | avl.preorder(); |
| 482 | avl.inorder(); |
| 483 | avl.postorder(); |
| 484 | avl.levelorder(); |
| 485 | println!("outside pre-in-pos-level order"); |
| 486 | preorder(&avl); |
| 487 | inorder(&avl); |
| 488 | postorder(&avl); |
| 489 | levelorder(&avl); |
| 490 | } |
| 491 | } |