Advertisement
- The runtime is O(n) because in the worst case, the node you are searching for is the last node, and every node in the linked list must be visited.
- The runtime is O(nk), with n representing the number of nodes and k representing the amount of time it takes to access each node in memory.
- The runtime cannot be determined unless you know how many nodes are in the singly linked list.
- The runtime is O(1) because you can index directly to a node in a singly linked list.
Join our list
Subscribe to our mailing list and get interesting stuff and updates to your email inbox.