Data Structures/Singly Linked List
dynamicsequentialpointer
Press play to start
1void insertAtHead(int val) {
2 Node* n = malloc(sizeof(Node)); n->val = val; n->next = head; head = n;
3}
Step 1/0

Practice

LeetCode·#206 Reverse Linked ListEasyHackerRank·Print Elements of a Linked ListEasyNeetCode·Reverse a Linked ListEasy
OperationBestAverageWorst
insert headO(1)O(1)O(1)
insert tailO(n)O(n)O(n)
removeO(1)O(n)O(n)
searchO(1)O(n)O(n)
SpaceO(n)