Everything about binary trees

This site has solutions (source code) for problems involving Binary trees. It contains source code in C as well as Java. All the solutions are recursive solutions.

Binary trees are recursive data structures, any operations on the binary trees (traversals, finding depths, search,printing) can be done recursively.

non recursive solutions for a binary tree are much complicated. Pre-order traversal of binary tree can be done easily without using the recursion (using stacks), but post-order and in-order are complicated. post-order and in-order non-recursive traversals require an additional element (visited) added to the binary tree data structure.