Purchase Solution

C++: Delete largest value from the list (priority queue)

Not what you're looking for?

Ask Custom Question

Assume that a doubly linked list "header" stores the elements of a priority queue. Implement the function pop(), which deletes the element with the largest value from the list (priority queue).

template < typename T >
void pop(dnode< T > *header);

Here is my best Guess at the problem!

{
if ( header->next = = header)
return;

dnode< T > *prevNode = header->prev, *succNode = header->next;

prevNode->next = succNode;
succNode->prev = prevNode;

delete header;
}

Purchase this Solution
Solution Summary

This solution is more of a guidance. Solution first gives an implementation (function body) considering that the priority queue is maintained sorted in descending order. Then it considers that case that the priority queue is maintained sorted in ascending order and indicates what modification should be made to function body for descending case.

Solution Preview

If you are maintaining priority queue sorted in descending order then the largest value will be in the header node (assuming doubly linked list is non-empty). In that case logic for pop function will be like as you have already guessed in right direction.

{
dnode < T > *newHeader; // Useful, in case header is passed by reference and you want changes to be reflected back.

if (header == NULL) // This signifies empty ...

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

Javscript Basics

Quiz on basics of javascript programming language.

View More Free Quizzes
Related BrainMass Solutions

  • C++ Functions and Responses

    uses one queue to delete another deletes all instances of the queue copies the queue into backup memory removes all elements from the queue leaving an empty queue Question 28 In a queuing system the time it takes for the

  • Data Structures Question

    32446 Data Structures Question 1) (a) Consider the following axioms from the Unsorted List ADT: Delete(Create, i1) = Create Delete(Make(L1, i2), i1) = IF i1 = i2 THEN L1 ELSE Make(Delete(L1, i1), i2) END IF Briefly describe the behaviour of the

  • Design a Queue Abstract Data Type Enqueue, Dequeue, Empty

    /Function to get (and delete) an item to the head/beginning of the queue void printQ (queue *Qpointer); //Print the Queue by starting from the beginning, following the chain of links until the end (NULL) has reached void empty (queue *Qpointer); //Emtpy

  • Functions of Lists and Queues in an Operating System

    A good implementation of the linked list would be in a priority queue.

  • Implement Dijkstra in C++

    For each step, create the list of minInfo elements in the priority queue and indicate which element is removed from the queue. Please see Graph 16-28(a) below Please see attached files.

  • C++ explained in this solution

    uses one queue to delete another removes the back element from the queue removes the front element from the queue removes all elements from the queue leaving an empty queue Question 33 Refer to the figure above.

  • Prim algorithm

    A list of minInfo elements in the priority queue and indicates which verticies and edges are in the current spanning tree.

  • Data Structure in C++ Using STL

    133925 Data Structures with C++ Using STL Declare a stack, queue, and priority queue of integers, as follows: stack s; queue q; priority_queue pq; Assume that you input the integer sequence 5 8 12 15 1 3 18 25 18 35 2 55

  • Stacks Problem

    Given a priority queue, list the order that items would be dequeued given the following set of queue operations. The items in the queue are prioritized by an integer value - higher values have a higher priority.

View More Related Solutions