Self-referential data structure: Difference between revisions

From Computer Science Wiki
(Created page with "<center> <blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;"> File:Exclamation.png This is student work which has not yet been approve...")
 
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
<center>
[[file:computation.png|right|frame|Programming<ref>http://www.flaticon.com/</ref>]]
<blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;">
  [[File:Exclamation.png]] This is student work which has not yet been approved as correct by the instructor
</blockquote>
</center>


[[file:Studying.png|right|frame|Case study notes<ref>http://www.flaticon.com/</ref>]]
A self-referential structure is one of the data structures which refer to the pointer to (points) to another structure of the same type. For example, a [[Linked list|linked list]] is supposed to be a self-referential data structure. The next node of a node is being pointed, which is of the same struct type. <ref>https://www.careerride.com/C-self-referential-structure.aspx</ref>


== Introduction ==
It is a special type of structure which contains a member of its own type. The member of its own type is actually a pointer variable of same structure in which it is declared.<ref>https://ladderpython.com/lesson/self-referential-structure/</ref>


Please write a clear, concise description of your topic here.You will likely reference your introduction from somewhere else. Please use the following syntax at the end of each of your ideas. '''IT IS CRITICAL YOU ATTRIBUTE''' others work. Your introduction should be factual. No more than 3 or 4 sentences, please. Because you are not an expert in your topic, I expect you to triangulate your information. LOTS OF LINK TO OTHER RESOURCES PLEASE! If you do not use a section, please delete it. Your finished page should only have information which explains your topic.
Within the context of blockchain, each block is linked to a previous or next node, much like a linked list.  
 
<nowiki>
<ref>the url I cited by material from</ref>
</nowiki>
 
Please delete any text on the page from our template. The only text on the page should be your work (and the category links on the bottom).
 
== How does it work or a deeper look ==
 
* If you are discussing a THING YOU CAN TOUCH, you must explain how it works, and the parts it is made of. Google around for an "exploded technical diagram" of your thing, [http://cdiok.com/wp-content/uploads/2012/01/MRI-Technology.jpg maybe like this example of an MRI]  It is likely you will reference outside links. Please attribute your work.
* If you are discussing a PROCESS OR ABSTRACT CONCEPT (like [[fuzzy logic]]) you must deeply explain how it works.
 
== Examples ==
 
Please include some example of how your concept is actually used. Your example must include WHERE it is used, and WHAT IS BENEFIT of it being used.
 
== Pictures, diagrams ==
 
Pictures and diagrams go a LONG way to helping someone understand a topic. Especially if your topic is a little abstract or complex. Using a picture or diagram is a two part process:
 
# [https://www.mediawiki.org/wiki/Help:Managing_files upload a file]
# [https://www.mediawiki.org/wiki/Help:Images use the file on a wiki page]
 
== External links ==
 
* It would be helpful
* to include many links
* to other internet resources
* to help fellow students
* Please make sure the content is good
* and don't link to a google search results, please


== References ==
== References ==
<references />
<references />


[[Category:2020 case study]]
[[Category:programming]]
[[Category:Student created article]]

Latest revision as of 15:01, 9 March 2020

Programming[1]

A self-referential structure is one of the data structures which refer to the pointer to (points) to another structure of the same type. For example, a linked list is supposed to be a self-referential data structure. The next node of a node is being pointed, which is of the same struct type. [2]

It is a special type of structure which contains a member of its own type. The member of its own type is actually a pointer variable of same structure in which it is declared.[3]

Within the context of blockchain, each block is linked to a previous or next node, much like a linked list.

References[edit]

  1. ↑ http://www.flaticon.com/
  2. ↑ https://www.careerride.com/C-self-referential-structure.aspx
  3. ↑ https://ladderpython.com/lesson/self-referential-structure/

The circumstances that form the setting for an event, statement, or idea, and in terms of which it can be fully understood and assessed.

Give a sequence of brief answers with no explanation.

Retrieved from "https://computersciencewiki.org/index.php?title=Self-referential_data_structure&oldid=10676"