breadth first search & depth first search using c++

how to write a c++ program that:
1) requires no user input
2) traverses a binary tree using depth first search algorithm
3) traverses a binary tree using breath first search algorithm

so when the program runs ... it displays the path of the tree traversed so far & the items in the stack or queue
Hi,
Well, best place is at the point where you realise this isn't a homework site and showing us where you are having problems etc with work you have put in. Cut and paste the assignment doesn't count.

Everybody here is glad to help when you get off the starting blocks :)
Topic archived. No new replies allowed.