![]() ![]() Linked list is non-consecutive nodes in memory, each node stores the actual data and the link to the next node (the address of the next node). Add, when array reaches max size, we need to copy all elements into new array: O(n), when not max size, it costs O(1).Remove, remove first element cost O(n) and remove last element costs O(1). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |