http://wiki.karljones.com/index.php?action=history&feed=atom&title=Linked_data_structure 2026-10-23T18:36:43Z Revision history for this page on the wiki MediaWiki 1.24.2 http://wiki.karljones.com/index.php?title=Linked_data_structure&diff=15059&oldid=prev 2016-05-10T00:26:38Z

<p>‎<span dir="auto"><span class="autocomment">See also</span></span></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 00:26, 10 May 2016</td> </tr><tr><td colspan="2" class="diff-lineno">Line 29:</td> <td colspan="2" class="diff-lineno">Line 29:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Expression tree]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Expression tree]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Linked list]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Linked list]]</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [[List of data structures]]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Pointer (computer programming)]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Pointer (computer programming)]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Reference (computer science)]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Reference (computer science)]]</div></td></tr> </table>

Karl Jones http://wiki.karljones.com/index.php?title=Linked_data_structure&diff=15058&oldid=prev 2016-05-10T00:26:09Z

<p>Created page with &quot;In <a href="/index.php/Computer_science" title="Computer science">computer science</a>, a &#039;&#039;&#039;linked data structure&#039;&#039;&#039; is a <a href="/index.php/Data_structure" title="Data structure">data structure</a> which consists of a set of <a href="/index.php?title=Data_record_(computer_science)&amp;action=edit&amp;redlink=1" class="new" title="Data record (computer science) (page does not exist)">data records</a> (Node (computer sci...&quot;</p> <p><b>New page</b></p><div>In [[computer science]], a '''linked data structure''' is a [[data structure]] which consists of a set of [[Data record (computer science)|data records]] ([[Node (computer science)|nodes]]) linked together and organized by [[Reference (computer science)|references]] (links or [[Pointer (computer programming)|pointers]]).<br /> <br /> The link between data can also be called a connector.<br /> <br /> == Description ==<br /> <br /> In linked data structures, the links are usually treated as special data types that can only be dereferenced or compared for equality.<br /> <br /> Linked data structures are thus contrasted with [[arrays]] and other data structures that require performing arithmetic operations on pointers.<br /> <br /> This distinction holds even when the nodes are actually implemented as elements of a single array, and the references are actually array indices: as long as no arithmetic is done on those indices, the data structure is essentially a linked one.<br /> <br /> Linking can be done in two ways:<br /> <br /> * [[Dynamic allocation]]<br /> * [[Array index linking]]<br /> <br /> Linked data structures include many other widely used data structures:<br /> <br /> * [[Linked lists]]<br /> * [[Search trees]]<br /> * [[Expression trees]]<br /> <br /> They are also key building blocks for many efficient algorithms, such as topological sort and set union-find.<br /> <br /> == See also ==<br /> <br /> * [[Data record (computer science)]]<br /> * [[Expression tree]]<br /> * [[Linked list]]<br /> * [[Pointer (computer programming)]]<br /> * [[Reference (computer science)]]<br /> * [[Search tree]]<br /> <br /> == External links ==<br /> <br /> * [https://en.wikipedia.org/wiki/Linked_data_structure Linked data structure] @ Wikipedia<br /> <br /> <br /> <br /> [[Category:Computer science]]<br /> [[Category:Data structures]]</div>

Karl Jones