Final exam review Fall2007:Definition Time
Help your fellow students here!
Back to Final Review-Fall 2007
Data Structure: A specialized format for organizing and storing data. The basic types of data structures include lists, arrays, trees, queues and stacks.
Graph: A kind of data structure, an Abstract Data Type, which consists of a set of nodes and a set of edges that establish relationships between the nodes.
Tree: A data structure that consists of a set of linked nodes. Each node may have child nodes which are below it.
Binary Trees: A tree data structure in which each node has at most two children.
REMOVEDked List: A data structure that consists of a sequence of nodes, each containing data fields and may point to the next and/or previous nodes.
Circular REMOVEDked List: A REMOVEDked List data structure where the last node is linked back to some other node before it to allow it to loop.
Arrays: A data structure that consists of a group of elements that are accessed by indexing.
Queue: A First-In-First-Out (FIFO) data structure.
Stack: A Last-In-First-Out (LIFO) data structure
Are they accurate?
are these going to be matching as on previous tests, or fill in the def?
Don't give them ideas man
Link to this Page
