Write a non-recursive implementation of inorder, preorder, postorder traversal.

Write a C program that takes inorder and preorder traversal as input, output the tree. You need to print the nodes of the tree level by level. Your code should output an error message if the inorder and preorder are not corresponding to the same tree.

Write a C program that takes inorder and postorder traversal as input, output the tree. You need to print the nodes of the tree level by level. Your code should output an error message if the inorder and preorder are not corresponding to the same tree.

Write a C program that takes preorder and postorder traversal as input, output the tree. It is given that each node consists of exactly two children. Your code should output an error message if the inorder and preorder are not corresponding to the same tree. You need to print the nodes of the tree level by level.

Write a C program that takes an arithmetic tree as input and outputs the result of the arithmetic expression. The leaf node is numeric data in an arithmetic expression tree, and the non-leaf/internal node is the operator.

Write a C program that prints the given tree vertically. The following example explains the vertical tree traversal.