Ok, to start off let me say I don't know what I'm talking about and I may or may not have just ingested an illegal substance that impaired my ability to fully understand what the penguin was telling me about Binary Search Trees. Alright, none of that's true, but regardless, I don't know much about Binary Search Trees and everything I do know is in theory, not in code, so if you post some code, my head might explode trying to read it. Just a warning. ... by the way, to the moderators, if you feel this is more appropriate in another forum, sorry and please switch it to where you like.
Ok, anyway... I was wondering if this would be a believable way of sorting or if it's just so ridiculously unnecessary that I should just give up on the idea of it.
Let's say you have data such as email addresses which could be broken down into logical sub-strings (the web address and the user). Could you make a Tree that basically searches the web addresses and when it finds the appropriate one, points to another tree of only the users in that address. Would this be more efficient or less efficient? Is it even possible (it seems possible, it's really just a struct with a string, a left pointer, right pointer, and pointer to another root)?