()
| 4 | |
| 5 | #[test] |
| 6 | fn build_binary_search_tree() { |
| 7 | let mut tree = Tree::default(); |
| 8 | let data = vec![4, 3, 8, 1, 7, 16, 2, 10, 9, 14]; |
| 9 | for v in &data { |
| 10 | tree.insert(*v, *v); |
| 11 | } |
| 12 | let r = unsafe { PreOrderVisitor::iterate(&tree) }; |
| 13 | assert_eq!(r, vec![4, 3, 1, 2, 8, 7, 16, 10, 9, 14]); |
| 14 | |
| 15 | for v in data { |
| 16 | assert!(tree.get(&v).is_some()); |
| 17 | } |
| 18 | assert_eq!(tree.get(&100), None); |
| 19 | } |
| 20 | |
| 21 | #[test] |
| 22 | fn binary_search_tree_min_max() { |