UMR-Blogs

TRIES (Data Structure) ·         The trie (pronounced ``try'' and derived from the word re trie val) also called prefix tree (as they can be searched by prefixes), for a set of strings S is an ordered tree such that: o    Each node but the root is labeled with a character o    The children of a node are alphabetically ordered ·         Each node has R children, one for each possible character. ·          All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. ·         Values are normally not associated with every node, only with leaves and some inner nodes that correspond to keys of interest. Example: car, card, carry, cart, cat, cel, celery, close, closely, closet, clue Applications of Tries ...