Linked List is a linear data structure and it is very common data structure which consists of group of nodes in a sequence which is divided in two parts. Each node consists of its own data and the address of the next node and forms a chain.
So , in linear Chain only sequential access will be possible and both BFS and DFS will give same traversal outputs
So, B should be correct.
Tell me...if i am wrong..