Node* head = new Node; head->data = 1; head->next = NULL;
Node* newNode = new Node; newNode->data = 2; newNode->next = head; head = newNode;
Node* curr = head; while(curr != NULL) { cout << curr->data << "->"; curr = curr->next; } cout << "NULL" << endl;In these examples, the package library used is likely the "Node Data Structure" library for C++. It provides a lightweight and efficient implementation of linked lists and other data structures commonly used in programming.