Friday, October 25, 2013

Linked Lists

Linked Lists:

Linked lists are recursive data structures that dynamically store objects as nodes. These nodes are linked to other nodes. In regards to regular lists, linked lists offer more freedom regarding inserting and removing a new node into the list. As a result, a linked list performs better in certain instances than a regular list, as seen with different implementation of queues. Linked lists are not new concepts for me, as I've dealt with various problems dealing with linked lists, so it was much easier to understand than say, for someone who has not dealt with linked lists before.

1 comment:

  1. Good description! If you're interested in looking into more kinds of linked lists, you can take a look at circular lists and think about how they could be useful: http://webdocs.cs.ualberta.ca/~holte/T26/circular-lists.html

    ReplyDelete