A stack that is implemented as a linked list is known as a deque.

Write a function   ListNode  * ListConcat(ListNode * list1, ListNode *list2)   That concatenates the items in list2 to the end of list1 and returns the resulting list. 

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; };                                 

A dynamic stack starts as an empty linked list.

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

A ________ is used to step through a linked list and search for data.

A new node must always be made the last node in the list.

A stack has two primary operations called ________.

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

Inserting an item into a linked list requires that all the items past the point of the insertion be shifted to make room for the new item.