title: Array VS single linked list VS double link list
body: <p>I am learning about arrays, single linked list and double linked list now a days and this question came that   </p>
  
  <p><em>" What is the best option between these three data structures when it comes to fast searching, less memory, easily insertion and updating of things "</em></p>
  
  <p>As far I know array cannot be the answer because it has fixed size. If we want to insert a new thing. it wouldn't always be possible. Double linked list can do the task but there will be two pointers needed for each node so there will be memory problem, so I think single linked list will fulfill all given requirements. Am I right? Please correct me if I am missing any point. There is also one more question that instead of choosing one of them, can I make combination of one or more data structures given here to meet all the requirements?</p>