this is a rather interesting assignment i have, and i have no clue where to start with it.
my instructor gave us a header for a binary tree that accepts and sorts strings. we must use it to take a single word (such as a name) , break it into its component letters and numbers, and insert them into a tree. then we must assaign each letter a 'path' meaning, it converts each letter into a number based upon the direction it had to move down the tree to get to that letter. for example, moving left would be '0', and moving right would be '1', then hold would be '2'.
basically, i have no idea where to even start, i just want to get an idea what others would do so that i can use that as a jump off point.
