C++ Implementation of Trie

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
900 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on May 22, 2011

A Trie (also called prefix tree) is a data structure which allow fast searching of strings in O(k) time where k is the length of string. Used mainly as dictionary, providing auto-completion feature etc. Read more here http://en.wikipedia.org/wiki/Trie

Category:

Education

Tags:

License:

Standard YouTube License

  • likes, 1 dislikes

Link to this comment:

Share to:
see all

All Comments (2)

Sign In or Sign Up now to post a comment!
  • Good demo

  • nice implementation, thanks for putting this up !!!

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more