pub struct BinaryTree<T>{ /* private fields */ }
Expand description
Binary Tree
use librualg::binary_tree::BinaryTree;
let mut tree = BinaryTree::new();
tree.add(3);
tree.add(7);
tree.add(2);
tree.add(9);
tree.add(5);
assert_eq!(tree.get(&7), Some(&7));
assert_eq!(tree.get(&8), None);
tree.remove(&7);
assert_eq!(tree.get(&7), None);
assert_eq!(tree.get(&5), Some(&5));
Implementations§
Auto Trait Implementations§
impl<T> Freeze for BinaryTree<T>
impl<T> RefUnwindSafe for BinaryTree<T>where
T: RefUnwindSafe,
impl<T> Send for BinaryTree<T>where
T: Send,
impl<T> Sync for BinaryTree<T>where
T: Sync,
impl<T> Unpin for BinaryTree<T>
impl<T> UnwindSafe for BinaryTree<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more