Course Title
: Data Structures |
||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||
In the previous lectures, we used an array to construct a list data structure and observed the limitation that array being of fixed size can only store a fixed number of elements. Therefore, no more elements can be stored after the size of the array is reached. In order to resolve this, we adopted a new data structure called linked list. We started discussing, how linked lists are stored in computer memory and how memory chains are formed. |
||||||||||||||||||||||||||||
|
|
|
NEXT |
|||||||||||||||||||||||||