redblackbst
| Crates.io | redblackbst |
| lib.rs | redblackbst |
| version | 0.1.1 |
| source | src |
| created_at | 2019-10-16 06:56:12.778192 |
| updated_at | 2019-10-24 04:36:32.413774 |
| description | Rust Algorithms |
| homepage | https://github.com/AbrarNitk/algorithmica |
| repository | https://github.com/AbrarNitk/algorithmica |
| max_upload_size | |
| id | 172914 |
| size | 7,569 |
Abrar Khan (AbrarNitk)
documentation
https://github.com/AbrarNitk/algorithmica
README
Red-Black Binary Search Tree
How to use
use redblackbst;
fn how_use() {
let mut bst = redblackbst::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);
}
Functions added in version 0.1.1
- height
- is_empty
- min
- max