Scribd
Upload
24 views4 pages

Lec-20,21 Tries Data Structure

Uploaded by

akyadav123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
24 views4 pages

Lec-20,21 Tries Data Structure

Uploaded by

akyadav123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 4

Tries Data Structure

Visit: tshahab.blogspot.com
Tries
 Trie is a special structure to represent
sets of character strings.
 Can also be used to represent data types
that are objects of any type e.g. strings of
integers.
 The word “trie” is derived from the
middle letters of the word “retrieval”.
Tries: Example
One way to implement a spelling checker is
 Read a text file.
 Break it into words( character strings
separated by blanks and new lines).
 Find those words not in a standard
dictionary of words.
 Words in the text but not in the dictionary
are printed out as possible misspellings.
Tries: Example
It can be implemented by a set having
operations of :
 INSERT
 DELETE
 MAKENULL
 PRINT
A Trie structure supports these set operations
when the element of the set are words.

You might also like