Description
Question-1
Write a program to implement a doubly linked list such that apart from the head pointer, you need to
maintain the tail pointer also that points to the last node of the linked list. Perform following operations1. Add Node to the start
2. Add Node to the end
3. Delete node from the list
4. Counting of the node
5. Display elements of the list
6. Search element in the list
7. Sort the elements of the list
