Part IlI: General Concept Questions. Provide an explanation. This may require mo

Question

Part IlI: General Concept Questions. Provide an explanation. This may require more than one sentence to describe (15 points): V pare the performance of-a prigrity queue implemented as an unsorted list, with a priority queue implemented as a sorted list, for the basic functions of insertte) and removemin). Discuss in terms of o (big O) notation. Assume t implement a vector as an array ofsize N) and I have a find function insert function: inserti,e), which inserts element e Ct+ code which will find where to place the element and then add the element e. ' gt index value . Write the pseudocode or 3. Using the following tree, how will the nodes be visited in (a) preorder traversal, (b) postorder traversal and (c) inorder traversal? 50 17 72 (12 (23) (54 76 9 (14 67

Explanation / Answer

Hi friend, I have answered Q3.

Please repost other in separate post.

a) preorder

50, 17, 12, 9, 14, 23, 72, 54, 67, 76

b) postorder

9, 14, 12, 23, 17, 67, 54, 76, 72, 50

c) inorder

9, 12, 14, 17, 23, 50, 54, 67, 72, 79

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---