Question

v. 15 points) implementing data structure operations C++ code for a new public member function to be added to the doubly linked list data structure used in class. Return the average value of all elements in the list ple a list of integers) Throws a length error exception if the list is empty. template «typename E> E& 0; average You may use loops or recursion as needed. If necessary, you may add private helper function0s) The definition of the DLinkedList class and its related DNode class are shown below along with the space to write your function. Template doubly linked list class using code from Data structures and Algorithms in c++, Goodrich, Tamassia, and Mount, 2011. #pragma once #include <stdexcept using namespace std; template typename E class DLinkedList; forward declaration to be used when declaring DNode template ktypename E> class DNode doubly linked list node private: E elem node element value previous node in the list DNode<E> "prev; DNode<E> next next node in the list provide DLinkedList access friend class DLinkedList<E template <typename E a doubly linked list class DLinkedList public: empty list constructor DLinked List(); destructor ~D LinkedList()i is list empty? bool empty() const; get front element E& front

Answer 1

Here is the average() method for you:

template <typename E>
E& DLinkedList<E>::average()
{
    DNode<E> *temp = header;
    E sum = 0.0;
    int count = 0;
    while(temp != nullptr)
    {
       sum += temp->elem;
       temp = temp->next;
       count++;
    }
    return sum / count;
}