Consider the following structure of a node for a linked list. struct Node { int key;...

Transcribed Image Text:

Consider the following structure of a node for a linked list. struct Node { int key; Node *next; }; class LinkedList { private: Node *head;//always points to the first node Node *tail;//always points to the last node public: LinkedList(){ } head = NULL; void insert(Node *prev, int newKey); Node searchList(int key); bool deleteAtIndex(int index); void printList(); ~LinkedList(); }; How can you check whether the linked list has only one node? Consider the following structure of a node for a linked list. struct Node { int key; Node *next; }; class LinkedList { private: Node *head;//always points to the first node Node *tail;//always points to the last node public: LinkedList(){ } head = NULL; void insert(Node *prev, int newKey); Node searchList(int key); bool deleteAtIndex(int index); void printList(); ~LinkedList(); }; How can you check whether the linked list has only one node?