Address the following in your response:

Review the following tree and then implement Depth First Traversals. Your program should display the output from Inorder to Preorder and Postorder.

Include the following items in your answer:

• Write the implementation for Inorder, Preorder, and Postorder
• Print the output for each of the Inorder, Preorder, and Postorder

Use the following steps to help with your solution:

• Create the node structure. Each node structure should contain the data, left node and right node.
• Create a function to add a node.
• Write the implementation for PrintInOrder.
• Write the implementation for PrintPreOrder.
• Write the implementation for PrintPostOrder.