Method iterate

src/tree/binary/traverse.rs:119–137

# Safety This is highly unsafe, due to pointer 时间复杂度 O(n), 空间复杂度 O(n)

(tree: &Tree<K, V>)

    /// This is highly unsafe, due to pointer
    /// 时间复杂度 O(n), 空间复杂度 O(n)
    pub unsafe fn iterate<K, V>(tree: &Tree<K, V>) -> Vec<K>
    where
        K: Copy,
    {
        let mut results = vec![];
        let mut stack = vec![];
        //point current node
        let mut p = tree.root;
        while let Some(node) = p {
            results.push(node.as_ref().key); //visit result
            for pp in [node.as_ref().right, node.as_ref().left].iter().flatten() {
                stack.push(*pp);
            }

            p = stack.pop();
        }

        results
    }

    /// # Safety
    ///