This document requests help completing code for a linked list data structure. It asks for help implementing a size() method that returns the number of nodes and a DeleteList() method that removes all nodes from the list and deallocates their memory as well as any pointed-to data. The document provides the template for a Node struct containing a data pointer and next pointer and for a Linkedlist class with private and public sections that is missing the requested size() and DeleteList() methods.

1. Basic c++:
In this program, I've completed the implementation of code below where it's not commented, can
anyone help me with size() and DeleteList()?
For DeleteList(), remove all items from the list. Deallocate all memory appropriately. This
includes not only the nodes in the list but the items being pointed to by the nodes. Note that the
data stored in the Node is a pointer.
template struct Node T data; Node *next; template class Linkedlist{ private: public:
Linkedlist(); Linkedlist(); bool Insert ( T* obj); // int Size() const; // void DeleteList(); bool
Merge(Linkedlist& list1);