What is Red-Black Tree DataStructure?

Which datastructure/algorithm to use for this problem?

• I have to find the best person to do a job.The key for searching the best matching person is based on the continent,country and city in which the resource lives For.e.g. Person X is living in New York and Person Y is living in Las Vegas.If I give the search key like this-NorthAmerica_USA_NewYork, the algorith/datastructure should be returning "X" as my resource.If I just enter search key-NorthAmerica_USA_NewJersey, the algorithm can either give me "X" or "Y" as there is no one in New Jersey and so it has to get the best possible match Using the first two keys.That is it has to first index by Continent,then country and then city.Is this sort of a tree where I first go depth wise and get best matching and keep coming up the levels if I dont find best matches?I want the searching algorithm/datastructure to be very fast. Can you please help me?

• Answer:

  var Loacation, State ,dir, String; i : integer; begin dir := ExtractFilePath(Applicatrion.ExeName)+'D… i := Continent.ItemIndex; if Not(i > -1) then begin ShowMessage('Please select a location first'); exit; end; Loacation := Continent.Items.Strings[i]; i := States.ItemIndex; if Not(i > -1) then begin ShowMessage('Please select a State first'); exit; end; State := States.Items.Strings[i]; List.Items.LoadFromFile(Dir+Loacation+… end; use in Delphi add two comboboxes and a listbox fill them with a list of locations and states have the onChange of the location listbox to load the correct states for the location drop a button on the form and your away other then that your on your own as you didnt say weather you wanted it in a program or on a webpage or other info on how you need or want it. what i posted will work for a program with a few more tweekings here and there you could even have it retrive all the list from the net hope this has helped in some way good luck with it