ept of linked list ALGORITHM: Write a C++ program to implement singly linked list data structures 1. Define a Node Structure: 2. Declare a structure named node with two members - an integer data and a pointer to the next node, link Main Function (main): 3. 4. 5. 6. Connect the head to current. 7. Create another node current and set its data to 98, and link to NULL. 8. Connect the previous current to this new current. Create a new node head and set its data to 45, and link to NULL. Create a new node current and set its data to 98, and link to NULL. 9. Call the printdata function to print the linked list. 10. Return 0 to indicate successful program execution 11. Print Data Function (printdata): 12. Declare a function printdata that takes a pointer to the head of the linked list. 13. Check if the linked list is empty (head is NULL), print "linked list empty" and return. 14. Initialize a pointer ptr to the head of the linked list. 15. Iterate through the linked list using a while loop until ptr becomes NULL. 16. Inside the loop, print the data of the current node and move ptr to the next node. 17. End the function.