【输出二叉树所有路径】

qq_30468249

已于 2022-06-21 14:22:51 修改

阅读量115

点赞数

文章标签： python 算法

于 2022-06-21 11:49:01 首次发布

本文链接：https://blog.csdn.net/qq_30468249/article/details/125387799

版权

二叉树深度优先搜索递归路径遍历嵌套字典

关键词由CSDN通过智能技术生成

输出二叉树所有路径

输入：

dic = {
    "title": "a",
    "children": [
        {
            "title": "b",
            "children": [
                    {"title": "c"}
            ]
        },
        {
            "title": "d",
            "children": [
                {
                    "title": "e",
                    "children": [
                        {"title": "f"}
                    ]
                },
                {
                    "title": "g",
                    "children": [
                        {"title": "h"}
                    ]
                }
            ]
        }
    ]
}

输出：

[['a', 'b', 'c'], ['a', 'd', 'e', 'f'], ['a', 'd', 'g', 'h']]

思路：深度优先+二分法+递归

代码：

def dict_to_list(dic: dict, path_list=None):
    if not path_list:
        path_list = [[]]
    path_list[-1].append(dic.get("title"))
    if "children" not in dic:
        return path_list
    else:
        children_list = dic.get("children")
        if len(children_list) < 1:
            return path_list
        elif len(children_list) == 1:
            child_left = children_list[0]
            return dict_to_list(child_left, path_list)
        else:
            child_left = children_list[0]
            child_right = children_list[1]
            path_list_buffer = list()
            path_list_buffer.extend(path_list[-1])
            path_list = dict_to_list(child_left, path_list)
            path_list.append(path_list_buffer)
            path_list = dict_to_list(child_right, path_list)
            return path_list