I am writing a program that maintains basic information about people (each person have id num, first name, last name).
I keep all the data using a binary tree, which DATA is PERSON type that I created. the data is sorted by ID number of the person.
I want to develop a search in the binary tree by the name of the person (the tree sorted by ID, not by the name...)
What is the most efficient way to do it?