Name________________________________________________

Convert the following infix expressions to prefix and postfix

A - B - C * (D + E / F - G) H

(A * B + C) / D - E / (F + G)

Show how the following infix expression is converted to postfix using a stack:

a*b/(c-d). Your answer should show the both the output and the elements in the stack as each input is read.

Assume two non-empty queues where head1 points to the head of the first queue and head2 points to the head of the second queue. Write an algorithm to append the second queue to the first queue.

Describe the use of templates in C++. Give an example

Assume that the operation of multiplication does not exist and that only repeated addition can be used. As an example, 2*3 has to be done by 2+2+2 adding 2 to itself 3 times. Write a recursive function in C++, mult, that uses only the addition operation.

Write pseudocode for the following linked list operations

Remove the last element in a linked list

Exchange the head of the list with the 3^rd element (if it exists).

For the binary tree shown on the whiteboard, show the LVR, VLR and LRV traversals