### Binary Tree Traversal

**Solution: **

- PreOrder (recursive & non-recursive)
- PostOrder (recursive & non-recursive)
- InOrder (recursive & non-recursive)
- Level Order
- Level Order in reverse

Source Code:

Github: BinaryTreeTraversal.java

**Output:**

Recursive PreOrder traverse: F, B, A, D, C, E, G, I, H, Non-Recursive PreOrder traverse: F, B, A, D, C, E, G, I, H, Recursive InOrder traverse: A, B, C, D, E, F, G, H, I, Non-Recursive InOrder traverse: A, B, C, D, E, F, G, H, I, Recursive PostOrder traverse: A, C, E, D, B, H, I, G, F, Non-Recursive PostOrder traverse: A, C, E, D, B, H, I, G, F, Level order traversal: F, B, G, A, D, I, C, E, H,