N叉树结构如下图所示:
我已经把这颗树的数据存成了如下的字典结构:dic
dic = {101: {1011: {}, 1012: {10121: {}, 10122: {101221: {}}}, 1013: {10131: {101311: {}, 101312: {1013121: {10131211: {}}}}, 10132: {101321: {}}}, 1014: {10141: {101411: {}}}, 1015: {}, 1016: {10161: {}}, 1017: {}, 1018: {10181: {}}, 1019: {}, 1020: {10201: {}, 10202: {}, 10203: {}}, 1021: {10211: {}, 10212: {}}}}
根据字典中的树数据关系,后序遍历输出,Python实现。
大佬们来点思路啊