mikel_binary_tree
| Crates.io | mikel_binary_tree |
| lib.rs | mikel_binary_tree |
| version | 0.1.7 |
| created_at | 2023-11-27 00:11:35.909018+00 |
| updated_at | 2024-12-18 20:50:43.122317+00 |
| description | Simple search binary tree implementation |
| homepage | https://github.com/apesteguia/binary_tree.git |
| repository | https://github.com/apesteguia/binary-tree |
| max_upload_size | |
| id | 1049531 |
| size | 14,811 |
Mikel (apesteguia)
documentation
README
Simple implementation of a binary tree.
Example
fn main() {
let mut a = BinaryTree::new(1);
a.insert(2);
a.vec_insert([1,2,3]);
a.delete(1);
for i in a.into_iter() {
println!("{}", *i);
}
}