Data Structures- a way of storying data in a computer so that it can be used efficiently. A carefully chosen data structure will allow a more efficient algorithm to be used.
Graph- that consists of a set of nodes & set or edges that establish relationships (connections) between nodes.
Tree-a data structure that emulates a tree structure with a set of linked nodes. Each node in a tree has O or more child nodes, below in the tree.
Binary tree - a tree data structure in which each node has at most 2 children.
REMOVEDked List-data structure with one or 2 links to similar types of nodes.
circular linked list-first and last nodes are linked.
Circular linked lists' first and last nodes are not necessarily linked; there is simply a connection from the end to some node in the middle so the list can loop
array- a linear data structure?
queue-first in first out data structure.
stack-first in last out data structure.
Link to this Page
Final Review-Spring 2007 last edited on 23 April 2007 at 11:13 pm by c-76-17-114-206.hsd1.ga.comcast.net
