compt 1.2.5

A complete binary tree visitor library
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

extern crate compt;
use compt::*;


fn main(){
	// Example that performs dfs in order traversal on the left side,
	// and bfs order traversal on the right side of a tree.
	// This demonstrates the composability of the different visitor functions.
	//
	//       0
	//   1       2
	// 3   4   5    6
	let mut k=compt::bfs_order::CompleteTree::from_vec(vec![0,1,2,3,4,5,6],3).unwrap();

	let k=k.vistr_mut();
	let (a,rest) = k.next();
	let (_,left,right)=rest.unwrap();

	let mut res:Vec<&mut usize>=Vec::new();
	res.push(a);
	
	left.dfs_inorder(|a,_|{
		res.push(a);
	});

	for (a,_) in right.bfs_iter(){
		res.push(a);
	}

	let res:Vec<usize>=res.drain(..).map(|a|*a).collect();
	assert_eq!(&res,&[0,3,1,4,2,5,6]);
}