foreach DFS/BFS for tree data-structure?

[Robert M. Münch]

I have a simple tree C data-structure that looks like this:

node {
	node parent:
	vector[node] children;
}

I would like to create two foreach algorthims, one follwing the breadth 
first search pattern and one the depth first search pattern.

Is this possible? I read about Inputranges, took a look at the RBTree 
code etc. but don't relly know/understand where to start.

-- 
Robert M. Münch
http://www.saphirion.com
smarter | better | faster