2D lists can only contain lists of same shapes.

Lists where controlled insertions and deletions take place such that insertions at the rear end and deletions from the front end, are queues.

A ragged list has same shape of all its elements.