Q1. Develop a new data structure that can work either as a stack or as a queue. That is, upon instantiation of the object, it may either use push/pop or insert/remove operations but not both. The data structure should be dynamic and shouldnt be restricted to size limitations. Illustrate your design and provide all necessary definitions for the new object and its operations in C language. (20 pts)

Q2. Step-by-step illustrate (draw) how the code fragment below works on the doubly-linked list structure given on the right: DLLNodePtr p = root, tmp; while (p != NULL)

if (p->left == NULL) { printf ("%3d", p->info); p = p->right; } else { tmp = p->left; while (tmp->right != NULL && tmp->right != p) tmp = tmp->right; if (tmp->right == NULL) { tmp->right = p; p = p->left; } else { printf ("%3d", p->info); tmp->right = NULL; p = p->right; } }

(20 pts)

Iroot 9 5 13 3 11 15