b_trees 0.0.12

Implementations for various binary trees including AVL tree
Documentation 
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

use crate::node::Node;

pub struct GreaterThan<'a, T> {
    lower: &'a T,
}

impl<'a, T> GreaterThan<'a, T> {
    pub(crate) fn new(root: Option<&'a Box<Node<T>>>, lower: &'a T) -> Self {
        todo!()
    }
}

impl<'a, T> Iterator for GreaterThan<'a, T> {
    type Item = &'a T;
    fn next(&mut self) -> Option<Self::Item> {
        todo!()
    }
}

pub struct LessThan<'a, T> {
    upper: &'a T,
}

impl<'a, T> LessThan<'a, T> {
    pub(crate) fn new(root: Option<&'a Box<Node<T>>>, upper: &'a T) -> Self {
        todo!()
    }
}

impl<'a, T> Iterator for LessThan<'a, T> {
    type Item = &'a T;
    fn next(&mut self) -> Option<Self::Item> {
        todo!()
    }
}