Talk:Data structure: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Greg Woodhouse
m (categories ok, not underlinked)
imported>Subpagination Bot
m (Add {{subpages}} and remove checklist (details))
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
{{checklist
{{subpages}}
|                abc = Data structures
 
|                cat1 = Computers
== A few comments ==
|                cat2 =  
 
|                cat3 =  
This looks good. For list structures, I think it's probably a good idea to focus on the basic variants first: singly linked lists, doubly linked lists and circular (usually doubly linked) lists. The optimizations you mention probably belong in separate articles. In the case of balanced trees, you probably ought to talk about some of the standard variants (red-black trees, 2-3 trees and 2-3-4 trees). If you do include B-trees, you should probably mention that 2-3-4 trees are the simplest non-trivial B-trees. You might also talk about the relationship of red-black trees and 2-3 trees (which are largely equivalent). Did you mention heaps? I may have missed it. In any case, thew two most standard variants are the binary heap and Fibonacci heap. When talking about graphs, do not forget directed graphs (digraphs) an the important case of directed acyclic graphs (DAGs). Another important topic for (general) trees is traversal strategy (depth first or breadth first). Trees and lists are, of course, examples of recursive data structures, and you might want to say something about recursion, though detailed treatment really belongs in another article.
|          cat_check = n
 
|              status = 2
 
|        underlinked = n
Okay, enough of my rambling! Nice work.
|            cleanup = y
[[User:Greg Woodhouse|Greg Woodhouse]] 22:58, 20 August 2007 (CDT)
|                  by = [[User:Greg Woodhouse|Greg Woodhouse]] 20:51, 20 August 2007 (CDT), [[User:Markus Baumeister|Markus Baumeister]] 14:54, 9 March 2007 (CST)
}}

Latest revision as of 08:18, 26 September 2007

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition A means of specifying how information is arranged on storage media for processing. [d] [e]
Checklist and Archives
 Workgroup category Computers [Categories OK]
 Talk Archive none  English language variant British English

A few comments

This looks good. For list structures, I think it's probably a good idea to focus on the basic variants first: singly linked lists, doubly linked lists and circular (usually doubly linked) lists. The optimizations you mention probably belong in separate articles. In the case of balanced trees, you probably ought to talk about some of the standard variants (red-black trees, 2-3 trees and 2-3-4 trees). If you do include B-trees, you should probably mention that 2-3-4 trees are the simplest non-trivial B-trees. You might also talk about the relationship of red-black trees and 2-3 trees (which are largely equivalent). Did you mention heaps? I may have missed it. In any case, thew two most standard variants are the binary heap and Fibonacci heap. When talking about graphs, do not forget directed graphs (digraphs) an the important case of directed acyclic graphs (DAGs). Another important topic for (general) trees is traversal strategy (depth first or breadth first). Trees and lists are, of course, examples of recursive data structures, and you might want to say something about recursion, though detailed treatment really belongs in another article.


Okay, enough of my rambling! Nice work. Greg Woodhouse 22:58, 20 August 2007 (CDT)