CareerCup

Insertion:
----------
1) Insertion at end = O(n) if tail pointer is not given.
2) Insertion at end = O(1) if tail pointer is given.
3) Insertion at middle = O(n) if index (or a node-value) is given.
4) Insertion at middle = O(1) if address is given.
5) Insertion at the start = O(1) always.

Deletion:
---------
1) Deletion with a value or an index = O(n).
2) Deletion with a given address = O(1). Tricky method.
3) Deletion of last node = O(n) with no tail pointer.
4) Deletion of last node = O(1) with a tail pointer.
5) Deletion of first node = O(1) always.

Searching:
----------
O(n) always. Best case is O(1).

Finding a loop = O(n).

Reversing a linked list = O(n).

Complexity for deletion will be O(n) and complexity for insertion will be O(1).

Insertion and deletion takes O(1), however searching for a particular node takes O(n)

inserting(insert in the p'th position) and deleting(a particular node) involves searching. So both takes O(n).

Only appending takes O(1).

correct me if I am wrong.

Hi Helper.
Could you plz explain how Deletion with a given address = O(1).