| binary search
| A | a search that works by starting in the middle and narrowing the search in a way similar to the way you search for a name in a phone book
|
| collision
| B | a tree traversal that visits the left node first, then the right node, then the root
|
| division-remainder method
| C | a search method that processes the key through a hashing algorithm to find the position of the data in a file
|
| exit condition
| D | a search technique in which each record in the database is compared in the order it appears until the desired record is found
|
| hashing
| E | in hashing, the condition where two key values produce the same result
|
| hashing algorithm
| F | a tree traversal that visits the root first, then the left node, then the right node
|
| in-order traversal
| G | an algorithm that converts a key to a number that corresponds to a position in a file
|
| key
| H | the condition which must be met to end recursive calls
|
| postorder traversal
| I | a programming technique in which a function calls itself
|
| preorder traversal
| J | a hashing algorithm which involves dividing the key value by a prime or odd number and using the remainder of the divi- sion as the relative address for the record
|
| recursion
| K | the value by which the data in a tree is sorted or searched or data in a data structure is searched
|
| sequential search
| L | a tree traversal that visits all the nodes of a tree in its sorted order
|