Skip to content

A trie, also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for locating specific keys.rom within a set.

Notifications You must be signed in to change notification settings

sagargoel2907/TRIE-implementation-in-Python

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 

About

A trie, also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for locating specific keys.rom within a set.

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages