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)