In the week 6, Tries data structure is explained. The concept is clear but it is not clear and infact not explained in the lecture as well that how a string can be searched?
Suppose "Dave" is stored. Now to search it back, only mechanism I can think of is assuming D will be at 3rd index in node1, A will be at 0th index in node2 and so on... But what sense does it make? Suppose I am using Tries for storing names, then how would I loop?
Also, it was said that end the end mark 'e' in "Dave" as checked to indicate end of string, but since same Tries instance of data structure will be used for storing many data, and I want to store "Daves" then how it would happen, because I have already checked 'e' as end of string. Could somebody please explain?