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 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
use std::cmp::{Ord, Ordering}; #[derive(PartialEq, Debug)] pub enum Color { RED, BLACK, } #[derive(Debug)] struct Node<Key: Ord, Value> { key: Key, value: Value, color: Color, left: Box<Option<Node<Key, Value>>>, right: Box<Option<Node<Key, Value>>>, } impl<Key: Ord, Value> Node<Key, Value> { pub fn new(key: Key, value: Value, color: Color) -> Self { Node { key, value, color, left: Box::new(None), right: Box::new(None), } } } #[derive(Debug)] pub struct RedBlackBST<Key: Ord, Value> { root: Option<Node<Key, Value>>, size: u64, } impl<Key: Ord, Value> RedBlackBST<Key, Value> { pub fn new() -> Self { Self { root: None, size: 0, } } pub fn size(&self) -> u64 { return self.size; } pub fn put(&mut self, key: Key, value: Value) { self.root = Self::insert(self.root.take(), key, value); self.size += 1; if let Some(root) = self.root.as_mut() { root.color = Color::BLACK; } } fn insert(node: Option<Node<Key, Value>>, key: Key, value: Value) -> Option<Node<Key, Value>> { match node { None => Some(Node::new(key, value, Color::RED)), Some(mut leaf) => { let mut leaf = match leaf.key.cmp(&key) { Ordering::Greater => { leaf.left = Box::new(Self::insert(leaf.left.take(), key, value)); leaf } Ordering::Less => { leaf.right = Box::new(Self::insert(leaf.right.take(), key, value)); leaf } Ordering::Equal => { leaf.value = value; leaf } }; if is_red(&leaf.right) && !is_red(&leaf.left) { leaf = rotate_left(leaf); } if is_red(&leaf.left) && is_red(&leaf.left.as_ref().as_ref().unwrap().left) { leaf = rotate_right(leaf); } if is_red(&leaf.left) && is_red(&leaf.right) { leaf = flip_colors(leaf); } Some(leaf) } } } pub fn get(&self, key: Key) -> Option<&Value> { Self::search(&self.root, key) } fn search(node: &Option<Node<Key, Value>>, key: Key) -> Option<&Value> { match node { None => None, Some(leaf) => match key.cmp(&leaf.key) { Ordering::Less => Self::search(&leaf.left, key), Ordering::Greater => Self::search(&leaf.right, key), Ordering::Equal => Some(&leaf.value), }, } } pub fn contains(&self, key: Key) -> bool { Self::search(&self.root, key).is_some() } } fn is_red<Key: Ord, Value>(node: &Option<Node<Key, Value>>) -> bool { match node { None => false, Some(Node { color, .. }) => color == &Color::RED, } } fn rotate_left<Key: Ord, Value>(mut h: Node<Key, Value>) -> Node<Key, Value> { let mut x = h.right.take().unwrap(); h.right = x.left; x.color = h.color; h.color = Color::RED; x.left = Box::new(Some(h)); x } fn rotate_right<Key: Ord, Value>(mut h: Node<Key, Value>) -> Node<Key, Value> { let mut x = h.left.take().unwrap(); h.left = x.right; x.color = h.color; h.color = Color::RED; x.right = Box::new(Some(h)); x } fn flip_colors<Key: Ord, Value>(mut h: Node<Key, Value>) -> Node<Key, Value> { if let Some(ref mut left) = h.left.as_mut() { left.color = Color::BLACK; } if let Some(right) = h.right.as_mut() { right.color = Color::BLACK; } h.color = Color::RED; h } #[cfg(test)] mod tests { #[test] fn init_test() { let mut bst = super::RedBlackBST::new(); bst.put(3, "1"); bst.put(2, "2"); bst.put(1, "3"); assert_eq!(bst.size(), 3); assert_eq!(bst.get(1), Some(&"3")); assert_eq!(bst.get(4), None); } }