Chp 12: Graph and Tree Traversal
Terms in this set (14)
Creating code to produce a programmed solution.
A set of data items of the same type grouped together with the same identifier.
A connection between two nodes in a graph or tree structure.
A data type made up of nodes and edges.
A method for traversing a graph that explores nodes closest to the starting node first before progressively exploring nodes that are further away.
A data structure where the first item added is the first item removed.
An element of a graph or tree.
A structure where each node can only have up to two child nodes attached to it.
A method of traversing a tree by visiting the root, traversing the left subtree and traversing the right subtree.
A method of traversing a tree by traversing the left subtree, visiting the root and traversing the right subtree.
A method of traversing a tree by traversing the left subtree, traversing the right subtree and then visiting the root.
The process of reading data from a tree or graph by visiting all of the nodes.
A technique for searching data that works by splitting datasets in half repeatedly until the search data is found.
A technique where a function can call itself in order to complete a task.
YOU MIGHT ALSO LIKE...
Accounting Information Systems
WJEC Computing A2
Data Structure and Algorithm - flashcards
1.4.2 Data Structures
OTHER SETS BY THIS CREATOR
Movement of substances into and out of cells
Year 9 Revision Terms
THIS SET IS OFTEN IN FOLDERS WITH...
Chp 43: Relational Databases
Chp 23: Number Systems
Chp 4: Subroutines, local & global variables
Chp 26: Coding Systems