{"id":3067,"date":"2018-03-29T19:35:00","date_gmt":"2018-03-29T19:35:00","guid":{"rendered":"http:\/\/itteacheritfreelance.hk\/wordpress\/?guid=a5bc7a4ea04b9269e51b7d1dd328fc5a"},"modified":"2018-03-29T19:35:00","modified_gmt":"2018-03-29T19:35:00","slug":"data-structures-and-algorithms-in-java-part-4-singly-linked-lists","status":"publish","type":"post","link":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/2018\/03\/29\/data-structures-and-algorithms-in-java-part-4-singly-linked-lists\/","title":{"rendered":"Data structures and algorithms in Java, Part 4: Singly linked lists"},"content":{"rendered":"

<\/p>\n

\n
\n

Like arrays, which were introduced in Part 3<\/a> of this tutorial series, linked lists are a fundamental data structure category upon which more complex data structures can be based. Unlike a sequence of elements, however, a linked list<\/em> is a sequence of nodes, where each node is linked to the previous and next node in the sequence. Recall that a node<\/em> is an object created from a self-referential class, and a self-referential class<\/em> has at least one field whose reference type is the class name. Nodes in a linked list are linked via a node reference. Here’s an example:<\/p>\n

To read this article in full, please click here<\/a><\/p>\n<\/section>\n<\/article>\n\n

\\\"IT\u96fb\u8166\u88dc\u7fd2
\u7acb\u523b\u8a3b\u518a\u53ca\u5831\u540d\u96fb\u8166\u88dc\u7fd2\u8ab2\u7a0b\u5427!<\/figcaption><\/figure>\r\n<\/br>Find A Teacher Form:\r\n<\/br>https:\/\/docs.google.com\/forms\/d\/1vREBnX5n262umf4wU5U2pyTwvk9O-JrAgblA-wH9GFQ\/viewform?edit_requested=true#responses\r\n<\/br><\/br>Email:\r\n<\/br>public1989two@gmail.com






\r\nwww.itsec.hk<\/a>
\r\nwww.itsec.vip<\/a>
\r\nwww.itseceu.uk<\/a>
<\/p>","protected":false},"excerpt":{"rendered":"

Like arrays, which were introduced in Part 3 of this tutorial series, linked lists are a fundamental data structure category upon which more complex data structures can be based. Unlike a sequence of elements, however, a linked list is a sequence of…<\/p>\n<\/div>","protected":false},"author":64,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"slim_seo":{"title":"Data structures and algorithms in Java, Part 4: Singly linked lists - ITTeacherITFreelance.hk","description":"Like arrays, which were introduced in Part 3 of this tutorial series, linked lists are a fundamental data structure category upon which more complex data struct"},"footnotes":""},"categories":[6],"tags":[],"_links":{"self":[{"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/posts\/3067"}],"collection":[{"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/users\/64"}],"replies":[{"embeddable":true,"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/comments?post=3067"}],"version-history":[{"count":1,"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/posts\/3067\/revisions"}],"predecessor-version":[{"id":3068,"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/posts\/3067\/revisions\/3068"}],"wp:attachment":[{"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/media?parent=3067"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/categories?post=3067"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/itteacheritfreelance.hk\/wordpress\/index.php\/wp-json\/wp\/v2\/tags?post=3067"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}