Is the node part okay?

is something wrong in the push() and pop() function correct because I keep getting violation signal

// Node constructor: initialize new nodes with an input string s // s should be stored as the data of the node // the nodes are not initially linked to any other node // so be sure that the "next" Node is linked to a nullptr Node: :Node(string s) \{ Node * newNode = new Node(s); newNode->data = s; newNode-> next = nullptr; \} First, Check if the stack is empty or not. If not, update the head, tail and count accordingly. "Don't forget to release memory using delete Hint: To update head and tail properly, You should consider two different scenarios: 1. If LLStack has more than one element 2. If LLStack has exactly one element void LLStack: :pop() \{ if ( count =1) \{ delete head; head =nu11ptr; tail = nullptr; count++; 3 else if[(count >1] f Node p= head next; I delete head; head =p; count--; 3 // Node constructor: initialize new nodes with an input string s // s should be stored as the data of the node // the nodes are not initially linked to any other node // so be sure that the "next" Node is linked to a nullptr Node: :Node(string s) \{ Node * newNode = new Node(s); newNode->data = s; newNode-> next = nullptr; \} First, Check if the stack is empty or not. If not, update the head, tail and count accordingly. "Don't forget to release memory using delete Hint: To update head and tail properly, You should consider two different scenarios: 1. If LLStack has more than one element 2. If LLStack has exactly one element void LLStack: :pop() \{ if ( count =1) \{ delete head; head =nu11ptr; tail = nullptr; count++; 3 else if[(count >1] f Node p= head next; I delete head; head =p; count--; 3