<mySearch ⁄>
<myBlog show="last" ⁄>
<myPhoto order="random" ⁄>
<mySnippets order="rand" ⁄>
<mySnippets type="lang" ⁄>
<myQuote order="random" ⁄>A falha surge da acomodação mental e física.
<myContacts ⁄><email ⁄>
<windows live messenger ⁄>
<myCurriculum type="pdf" ⁄>
<myVisitorsMap ⁄>Linked list is a linear collection of Self-Referential class objects, called nodes, connected by reference links. Many people tend to think of it as of dynamically sized array but you need to understand difference between these two data structures.
Notice three things about the list:
- The pointer at the end of the list is null.
- Each node's next pointer points to another unique node in the list or to Null, making the list a linear graph.
- The first node of the list is pointed to by a pointer called head.
The most common and the simplest kind of linked list is a singly-linked list. A singly-linked list containing two values: the value of the current node and a link to the next node.
este é só um excerto do artigo, para aceder ao artigo completo, clique no link em baixo:
this is just a small excerpt from the article, to access the full article please click in the link below:
http://interviewpattern.com/post/2009/04/30/Linked-List-Interview-Ques...
<myNews show="rand" cat="programacao" ⁄>