What is time complexity of insertion deletion and searching in linked list

#1

I want to know all possible complexities when insert at head, deleete at head, middle so on

#2

insertion at head,deletion from front :
O(1) as you only need to change some pointers address

deletion /insertion at end/middle : O(n)
as you need to traversal (whole) list