C++ data structure

Part Ill: General Concept sentence to describe (15 points): 1. Compare the performance of a priority queue implemented as an unsorted l ore than one is, with a priority queue implemented as a sorted list, for the basic f unctions of insertle) and removemin). Discuss in terms of O (big O) notation. Assume t implement a vector as an array of size N) and I have a find function: find e) and an C++ code which will find where to place the element and then add the element 'e Using the following tree, how will the nodes be visited in (a) preorder traversal, (b) postorder + Sinsert function: insertli.e), which inserts element e' at index value 't. Write the pseudocode or 3. traversal and (c) inorder traversal? 50 17 72 76 9 (14 67