Question: Write a program which performs the following types of iterative traversal on a binary tree and display the result. 1. Inorder 2. Preorder 3. Postorder The functions should be implemented using linked lists and separate function should be made for each of the type. Guidelines: You can use a hard-coded binary tree and show only traversing. There should be a main function calling these functions. If traversal is done through recursion, zero marks will be given