||Insertions and deletions are difficult.
||Insertions and deletions can be done easily.
||It needs movements of elements for insertion and deletion.
||It does not need movement of nodes for insertion and deletion.
||In it space is wasted.
||In it space is not wasted.
||It is more expensive.
||It is less expensive.
||It requires less space as only information is stored.
||It requires more space as pointers are also stored along with information.
||Its size is fixed.
||Its size is not fixed.
||It can not be extended or reduced according to requirements.
||It can be extended or reduced according to requirements.
||Same amount of time is required to access each element.
||Different amount of time is required to access each element.
||Elements are stored in consecutive memory locations.
||Elements may or may not be stored in consecutive memory locations.
||If have to go to a particular element then we can reach there directly.
||If we have to go to a particular node then we have to go through all those nodes that come before that node.