Implement a program that prints preorder, inorder and postorder traversal of a tree

Implement a function which when given an entry point to a tree, prints its preorder, inorder and postorder traversal.

Write a sample use of the checker function in the main function of your program. Also, specify the data structure used for the tree.

Hint: Use recursion for succinct code. For the really adventurous, try doing the same iteratively (you will need to use a stack).

The issue names no source file or test; start by locating the tree implementation and the program's main function. Done means the program specifies its tree data structure, prints preorder, inorder, and postorder traversals, and includes a sample use of the checker function.

Written by the indexing model from the issue text.