고지식한 컴퓨터 공대생의 나날들

Linked list Array 공통점 store linear data of similar types Size Dynamic size fixed cost Inserting a new element in an array of elements is expensive Random access Possible impossible Extra memory Extra memory space for a pointer is required unrequired Accessible with Linke index