Hello,
Been wondering what is the time complexity of algorithm if we erase all elements in a linked list?
Also what is the big O notation (complexity) difference betwen erasing element in a single and doubly linked list?
How can we calculate that?
Thanks in advance!