blob: b3f6addcb58c0886fdb56d0f8c01e42ec52af141 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
use std::cmp::Ordering;
struct AVLNode<T: Ord> {
value: T,
left: AVLTree<T>,
right: AVLTree<T>,
}
type AVLTree<T> = Option<Box<AVLNode<T>>>;
struct AVLTreeSet<T: Ord> {
root: AVLTree<T>,
}
impl<T: Ord> AVLTreeSet<T> {
pub fn new() -> Self {
Self { root: None }
}
pub fn insert(&mut self, value: T) -> bool {
let mut current_tree = &mut self.root;
while let Some(current_node) = current_tree {
match current_node.value.cmp(&value) {
Ordering::Less => current_tree = &mut current_node.right,
Ordering::Equal => return false,
Ordering::Greater => current_tree = &mut current_node.left,
}
}
*current_tree = Some(Box::new(AVLNode {
value,
left: None,
right: None,
}));
true
}
}
fn main() {
let mut tree = AVLTreeSet::new();
tree.insert(3);
tree.insert(2);
}
|
