Creating a tree data structure

I have some data:

A
AXNHJNEHWXNOECMEJK
DNFJNXYEEQWhsdbchjsxs
XMJQWsdsEOJdfsKMDJE

....

Each row is an array, and each letter is an object. I have a comparison function that can say that the letter A is equivalent to the letter a (in fact it is not a letter. These Russian words and the comparison function use morphology to tell me that the word is equal, for example, matryoshka == nesting dolls == nesting dolls and arrays of Russian sentences, for example: “Mom washed the frame”). I want to create a tree data structure that looks like this:

1) A
2.1) BA
2.2) DHBAFH
3.1) BEDMEWA
etc...

. , Google AdWords, , . - FAST. . ( ), .

( ):

1) 
1->2.1)  
1->2.2)  
1->2.3)      
1->2.2->3)    

:

1)     
1)    

, .