LinkedList

Question 1

Time complexity

Answer 1

Insert first / last - O (1) ( doubly linked list)
Insert - O (n) ( single linked list)
Insert/delete any position- O(n)
Search - O(n)

Question 2

Reverse

Answer 2

• Using stack
• Recursively ( call stack)
• In place