一个有难度的java树状结构题目，100分，请高手帮忙 谢谢

Question

这样一个list:
          List<String> list = new ArrayList<String>();
 list.add("name11-name20-name31-name43-name8-name51-name61-name71-name81"); 
           list.add("name11-name20-name32-name46-name8-name52");
 list.add("name11-name21-name31-name44-name8-name50-name61");
 list.add("name11-name22-name32-name45-name8-name52");  
 list.add("name11-name24-name33-name47-name8-name53");
 list.add("name11-name25-name34-name43-name8"); 
现在想把它变成树状结构的xml，
name11是根节点，下面有5个分支20,21,22,24,25
20分节点下面分为31 32 分支
以此类推
输出xml字符串例如：<node label='name11'>                                                                        
<node label='name20'>                                                                
<node label='name31'>                                                        
<node label='name43'>                                                
<node label='name8'>                                         
<node label='name51'>                                
<node label='name61'>                        
<node label='name71'>                
<node label='name81'></ node>
</ node>                             
</ node>
</ node>              
</ node>                                                     
</ node>                                                             
</ node>                                                                     
<node label='name32'>                                                        
<node label='name46'>                                                
<node label='name8'>                                         
<node label='name52'> </ node>
</ node>                                                     
</ node>                      
</ node>                                                                     
                                                                                     
</ node>                                                                             
<node label='name21'>                                                                
<node label='name31'>                                                        
<node label='name44'>                                                
<node label='name8'>                                         
<node label='name50'>                      
<node label='name61'></ node>                
</ node>      
</ node>                                                     
</ node>                      
</ node>                                                                     
                                                                                     
</ node>                                                                             
<node label='name22'>                                                              
<node label='name32'>                                                        
<node label='name45'>                                                
<node label='name8'>                                         
<node label='name52'></ node>
</ node>                                                     
</ node>                      
</ node>                                                                     
</ node>                                                                             
<node label='name24'>                                                                
<node label='name33'>                                                        
<node label='name47'>                                                
<node label='name8'>                                         
<node label='name53'> </ node>
</ node>                                                     
</ node>                      
</ node>                                                                     
                                                                                     
</ node>                                                                             
<node label='name25'>                                                                
<node label='name34'>                                                        
<node label='name43'>                                                
<node label='name8'> </ node>                             
</ node>                      
</ node>                                                                     
                                                                                     
</ node>                                                                             
</ node>                                                                                     一经解决，立即给分。

Answer 1

给你点提示，使用二叉树，结构可以使用左孩子，右兄弟方式处理。

Answer 2

二叉树是数据结构里非常经典的算法，网上有很多这样的算法。