Problem 8 Here is an excerpt from the definition of a singly-linked list class. A LinkedList object represents a singlylinked list of integers. The implementation dynamically allocates the nodes it needs, uses no dummy node, and indicates the end of the l
education
Description
Problem 8 Here is an excerpt from the definition of a singly-linked list class. A LinkedList object represents a singly linked list of integers. The implementation dynamically allocates the nodes it needs, uses no dummy node, and indicates the end of the list by the las node having NULL as its m_next data member. The empty list is represented by m_head and m_tail being NULL. class LinkedList { public: LinkedList(); // creates an empty list … void push_back (int v); void unique(); bool dominates (LinkedList& other) const; { return dom(m_head, other.m_head); }
