Assume a liked list data structure of any size. You can consider the following  linked list data structure as an example. 

Transcribed Image Text:

Top = 4000 12 4000 6000 4008 6000 5000 6008 18 5000 3000 5008 20 3000 Last = 3000 '0' 3008 a) The value 15 is your current node. Enter a node after 15. What is the complexity (search) of this operation? Please demonstrate / justify your answer. b) The value 18 is your current node. Enter a node before 15. What is the complexity (search) of this operation? Please demonstrate /justify your answer. Top = 4000 12 4000 6000 4008 6000 5000 6008 18 5000 3000 5008 20 3000 Last = 3000 '0' 3008 a) The value 15 is your current node. Enter a node after 15. What is the complexity (search) of this operation? Please demonstrate / justify your answer. b) The value 18 is your current node. Enter a node before 15. What is the complexity (search) of this operation? Please demonstrate /justify your answer.

Answer rating: 100% (QA)

a The value 15 is your current node Enter a node after 15 What is the complexity search of this operation Please demonstratejustify your answer To enter a node after 15 we need to traverse the linked ... View the full answer