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:

Computer Engineer,Sociologist, CSE Master Student

Computer Engineer,Sociologist, CSE Master Student