下面是作为字典的树:
tree = {'X1': {0: {'X2': {0: 0, 1: {'X3': {0: 1, 1: 0}}}}, 1: {'X3': {0: 1, 1: 0}}}}
如何在 python 中遍历这棵树并仅打印节点?例如X1, X2...
请您参考如下方法:
您需要逐步遍历 dict 的每一层,打印出所有匹配的键,然后如果值是嵌套的 dict 则调用相同的函数(递归) :
tree = {'X1': {0: {'X2': {0: 0, 1: {'X3': {0: 1, 1: 0}}}}, 1: {'X3': {0: 1, 1: 0}}}}
def recurse(d):
for x, v in d.items():
if str(x).startswith('X'):
print(x)
if isinstance(v, dict):
recurse(v)
recurse(tree)
