Example of singly linked list:```cpp#include using namespace std;struct Node { int data; Node next;};int main() { Node head = new Node(); head->data = 10; head->next = nullptr; Node second = new Node(); second->data = 20; second->next = nullptr; head->next = second; Node temp = head; while(temp != nullptr) { cout << temp->data << " "; temp = temp->next; } return 0;}Tip: For dynamic lists, use functions to insert and delete nodes; linked lists provide flexible memory usage compared to arrays.