Coding using c++ language

Question 1 : Provide pseudocode for either preorder traversal or postorder traversal for general trees without recursion (hint: use a stack). Also provide pseudocode for breadth-first (level order) traversal for general trees (hint: use a queue).

Question 2: What are the running-times for the two algorithms?

Question 3: Provide preorder traversal, postorder traversal, and level-order traversal for the following tree

. A

/ | \

B C D

/ \ / | \

E F G H I