Struct librualg::binary_tree::BinaryTree [−][src]
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
impl<T> BinaryTree<T> where
T: Ord + Clone + Display,
[src]
impl<T> BinaryTree<T> where
T: Ord + Clone + Display,
[src]Auto Trait Implementations
impl<T> RefUnwindSafe for BinaryTree<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for BinaryTree<T> where
T: Send,
T: Send,
impl<T> Sync for BinaryTree<T> where
T: Sync,
T: Sync,
impl<T> Unpin for BinaryTree<T>
impl<T> UnwindSafe for BinaryTree<T> where
T: UnwindSafe,
T: UnwindSafe,