Someone can help me to solve some problem about computer science ?

Provide an explanation. (more than on sentnce to describe) . ( 1 ~ 3)

1. Comppare the performance of a priority queue implemented as anunsorted list, with a priority queue implemented as a sorted list, for the basic functions of insert(e) and removemin(). Discuss in terms of O (big O) notation

2. Assume I implement a list as an array of size N, and I have a find function : find(3) and an insert function : insert (i,e), which inserts element 'e' at index value 'i'. Write the pseudocode or C++ code which will find where to place the element and then add the element 'e'.

3. Using the following tree, how will the nodes be visited in (a) preorder traversal, (b) postorder traveral and (c) inorder traversal?

50 / \ 17 72 / \ / \ 12 23 54 76 / \ \ \ 9 14 19 67

4. convert the following infix arithmetic expreession to postfix notation. Show how you would use a stack to determine the result. Do not wirte the program code. Olny explain how the stack would be used to develop the output. ((6 + 8) * (9 - 6)) / 2 + 4 - 3 * 2

5. Show how a tree would represent the following postfix expression. A B - C + D E F - + *

6. Calculate the result of the following postfix expression, using a stack. DO NOT . write the program code. Olny explain how the stack would be used to calculate the result. When you are done, the answer should be the only element in the stack. 10 4 + 6 * 5 3 - 2 4 + * -