| 439 | |
| 440 | #[test] |
| 441 | fn t_calc_size() { |
| 442 | let mut tree = Tree::default(); |
| 443 | for v in 0..100 { |
| 444 | tree.insert(v, v); |
| 445 | } |
| 446 | assert_eq!(100, bst::calc_size(tree.root)); |
| 447 | |
| 448 | // 重复加入 |
| 449 | tree.insert(0, 0); |
| 450 | assert_eq!(100, bst::calc_size(tree.root)); |
| 451 | |
| 452 | // 加入新元素 |
| 453 | tree.insert(100, 100); |
| 454 | assert_eq!(101, bst::calc_size(tree.root)); |
| 455 | |
| 456 | // 删除一个 |
| 457 | tree.delete(&100); |
| 458 | assert_eq!(100, bst::calc_size(tree.root)); |
| 459 | |
| 460 | // 删除一个不存在的 |
| 461 | tree.delete(&10000); |
| 462 | assert_eq!(100, bst::calc_size(tree.root)); |
| 463 | } |