Python recursive output dictionary all paths of different depths

Application Scenarios

Suppose there is such a dictionary structure test_dict = {' A ': {' B ': {' c ': 1}}, ' d ': 2},test_dict can actually be seen as a tree structure, where each leaf node depth is not necessarily the same, if we want to output the root node to all leaf node paths, That is a->b->c->1;d->2, how to solve?

Code

  
 

   
  

  
#encoding=utf-8
   
  

  
import sys
   
  

  

   
  

  
def recurPrintPath(dic):
   
  

  
 for key in dic.keys():
   
  

  
 print key
   
  

  
 #判断下一级是否还是字典，如果是字典继续递归
   
  

  
 if type(dic[key]) == type({}):
   
  

  
 recurPrintPath(dic[key])
   
  

  
 else:
   
  

  
 print dic[key]
   
  

  
 print ‘--------------‘
   
  

  

   
  

  
def main():
   
  

  
 reload(sys)
   
  

  
 sys.setdefaultencoding(‘utf-8‘)
   
  

  

   
  

  
 test_dict = {‘a‘:{‘b‘:{‘c‘:1}},‘d‘:2}
   
  

  
 recurPrintPath(test_dict)
   
  

  

   
  

  
if __name__ == ‘__main__‘:
   
  

  
 main()
  
 

Output Result:

  
 

   
  
 
   
a
 
   
b
 
   
c
 
   
1
 
   
--------------
 
   
d
 
   
2
 
   
--------------
 
  
  
 

From for notes (Wiz)

Python recursive output dictionary all paths of different depths