Trie as a type of tree. Usually used letter as a node. Search specific key is efficient, at most length of a key. İt’s expand if space is available. Usually used as word index. İf you want a easily understand Trie Data Structure you have to see this graphics:

İt save space (kind of still used redundant space). This structure can used in string matching also.

Originally published at anilkaynr.wordpress.com on December 4, 2018.

Computer Engineer,Sociologist, CSE Master Student

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store