Hi all This isn't strictly AI-related but close. I'm looking for a good book that can give me some background theory and/or algorithms for walking (binary) trees. I have the ground work from university and bits and pieces on the web, but I'm after more detailed discussions. It's basically graph theory or graph search algorithms I'm after. Any language is fine, preferably in the C family though (C/C++/Java/C#) I tried a book titled Graph Theory from amazon but it wasn't what I was after.

The wikipedia page is pretty useful. And it's free! There are a wealth of resources online for this sort of stuff, getting a book might be a waste of money.

I did a bit more research since the post and got recommended a few books:

http://www.algorist.com/
http://www.amazon.co.uk/Introduction-Algorithms-Thomas-H-Cormen/dp/0070131511/ref=cm_cr_pr_product_top

Plus I found a really good resource for algorithms:

http://www.cs.sunysb.edu/~algorith/video-lectures/

His lectures (author of Algorithm design manual) on video. Hope this helps others who might stumble on this thread.

The wikipedia articles are OK, but not outstanding. They assume prior knowledge I think, which I have for more types of binary trees and traversing (2 anyway), so they refresh instead of teaching new knowledge well imo.