There is a family of tree search algorithms that compare ordered keys with one another to see if they are greater or less; the simplest one uses a binary search tree; and there is a family of tree data structures known as tries (what is this trie thing ?) that don't compare keys with one another except at the end. |

There is a family of tree search algorithms that compare ordered keys with one another to see if they are greater or less; the simplest one uses a binary search tree; and there is a family of tree data structures known as tries that don't require a key compare until the end of the search. |