Class Implementation (Hash Table)

Can you please explain the destructor part in the video?

Each node/container of the hashtable has a next pointer to it which is inititalized to NULL using the constructor.At the end of the scope we have to deleted/unallocate memory. This is done by the destructor.
At the end the destructor for each node will be called(it will be a recursive destructor call) and the memory allocated to each node will be destroyed

share the video please!!

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.