insert()
takes O(1)
as you can add an element to the head
of the linked list in constant time
find()
takes O(n)
time as in the worst case you need to traverse the list till you reach the tail
These apply for both single and doubly linked lists