Blog

Consider the following header file (NumberList.h). This program will add decimal values to a link list. Write the corresponding cpp file (NumberList.cpp) to include the function bodies for add(), displayList() and a destructor to deallocate the memory used by the list.          #include using namespace std; class NumberList { protected:     // Declare a class for the list node     struct ListNode     {        double value;        ListNode *next;        ListNode(double value1, ListNode *next1 = NULL)        {           value = value1;           next = next1;        }          };       ListNode *head;                   // List head pointer public:     NumberList() { head = NULL;  }    // Constructor     ~NumberList();                    // Destructor     void add(double number);     void displayList() const; };                                 

Which of the following are linked list operations?

The STL implementation of a linked list is a class called ________.

If new information needs to be added to a linked list, the program simply ________ and inserts it into the list.

In a dequeue operation, the element at the ________ of the queue is removed.

Nodes in a linked list are stored in contiguous memory.

For most people, ________ queues are more intuitive and easier to understand than ________ queues.

When you delete a node from a linked list, you must ensure that the links in the surrounding nodes are set to bypass the node being deleted.

The ________ operation allows an item to be stored on a stack.

A real-world example of the queue data structure can be seen in a stack of cafeteria trays, where the last tray pushed onto the stack is the first tray removed.