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
36
37
38
39
40
41
42
43

use crate::Node;
use std::collections::LinkedList;

pub struct IntoIter<T> {
    pub(crate) nodes: LinkedList<Box<Node<T>>>,
}

impl<T> Iterator for IntoIter<T> {
    type Item = T;
    fn next(&mut self) -> Option<Self::Item> {
        let mut node = self.nodes.pop_front();
        if let Some(node) = &mut node {
            if let Some(l_node) = node.left.take() {
                self.nodes.push_back(l_node);
            }
            if let Some(r_node) = node.right.take() {
                self.nodes.push_back(r_node);
            }
        }
        node.map(|n| n.val)
    }
}


pub struct Iter<'a, T> {
    pub(crate) nodes: LinkedList<&'a Box<Node<T>>>,
}

impl<'a, T> Iterator for Iter<'a, T> {
    type Item = &'a T;
    fn next(&mut self) -> Option<Self::Item> {
        let node = self.nodes.pop_front();
        if let Some(node) = node {
            if let Some(l_node) = &node.left {
                self.nodes.push_back(l_node);
            }
            if let Some(r_node) = &node.right {
                self.nodes.push_back(r_node);
            }
        }
        node.map(|n| &n.val)
    }
}