Problem
1. Give an example of a tree for which the stack in a preorder traversal uses more space than the queue in a level-order traversal.
2. Give an example of a tree for which the stack in preorder a traversal uses less space than the queue in a level-order traversal.
3. Give a stack-based implementation of post order traversal of a binary tree. I0.. Write a program to implement level-order traversal of a forest represented as a binary tree.