Наполнение списка в виде структуры дерева

[
children:[
{
text: «Title 1», id: ‘1’, expanded: true,
children: [
{
text: «title2», leaf: true ,
},
{
text: «title3», leaf: true
}
]
},
{
text: «Title4», id: ‘4’, expanded: true,
children: [
{
text: «title5», leaf: true ,
}
]
}
]
]

mylist =[{‘id’: ‘1’, ‘name’: ‘Title1’, ‘id_parent’: ‘0’}, {‘id’: ‘2’, ‘name’: ‘title2’, ‘id_parent’: ‘1’}, {‘id’: ‘3’, ‘name’: ‘title3’, ‘id_parent’: ‘1’}, {‘id’: ‘4’, ‘name’: ‘Title4’, ‘id_parent’: ‘0’},
{‘id’: ‘5’, ‘name’: ‘title5’, ‘id_parent’: ‘4’}]

def get_parent(id_parent):
c = []
for x in mylist:
if not x[«id»] == id_parent and x[«id_parent»] == id_parent:
if x[«id_parent»] == «0»:
x[‘expanded’] = True
else:
x[‘leaf’] = True
c.append(x)
return(c)
def get_tree(t):
lst = []
main_data = []
for x in get_parent(t):
all_stor = {}
all_stor[«text»] = x[‘name’]
all_stor[«id»] = x[‘id’]
if x.get(‘expanded’):
all_stor[«expanded»] = x[‘expanded’]
else:
all_stor[«leaf»] = x[‘leaf’]
main_data.append(all_stor)#Как правильно создать необходимую структуру?
lst.append([main_data, get_tree(x[«id»])])
return lst
main = get_tree(«0»)
print(main)

[
children:[
  {
    text: "Title 1", id: '1', expanded: true,
    children: [
    {
        text: "title2", leaf: true ,
    },
    {
        text: "title3", leaf: true
    }
    ]
 },
 {
    text: "Title4", id: '4', expanded: true,
    children: [
    {
        text: "title5", leaf: true ,
    }    
    ]
 }
 ]
 ]

mylist =[{'id': '1', 'name': 'Title1', 'id_parent': '0'}, {'id': '2', 'name': 'title2', 'id_parent':
 '1'}, {'id': '3', 'name': 'title3', 'id_parent': '1'}, {'id': '4', 'name': 'Title4', 'id_parent': '0'},
 {'id': '5', 'name': 'title5', 'id_parent': '4'}]

def get_parent(id_parent):
    c = []
    for x in mylist:
        if not x["id"] == id_parent and x["id_parent"] == id_parent:
            if x["id_parent"] == "0":
                x['expanded'] = True
            else:
                x['leaf'] = True
            c.append(x)
    return(c)
def get_tree(t):
    lst = []
    main_data = []
    for x in get_parent(t):
        all_stor = {}
        all_stor["text"] = x['name']
        all_stor["id"] = x['id']
        if x.get('expanded'):
            all_stor["expanded"] = x['expanded']
        else:
            all_stor["leaf"] = x['leaf']
           
        main_data.append(all_stor)#Как наполнить список необходимой структурой
        lst.append([main_data, get_tree(x["id"])])
    return lst
main = get_tree("0")
print(main)

q = []
i = []
f = []
h = []
a = {}
b = {'text': "Title 1", 'id': 1, 'expanded': True}
c = {'text': "title2", 'leaf': True}
d = {'text': "title3", 'leaf': True}
e = {'text': "Title 4", 'id': '4', 'expanded': True}
g = {'text': "title5", 'leaf': True}
 
i.append(c)
i.append(d)
f.append(g)
b['children'] = i
e['children'] = f
h.append(b)
h.append(e)
a['children'] = h
main = [a]
print(main)

mylist =[{'id': '1', 'name': 'Title1', 'id_parent': '0'}, {'id': '2', 'name': 'title2', 'id_parent':
 '1'}, {'id': '3', 'name': 'title3', 'id_parent': '1'}, {'id': '4', 'name': 'Title4', 'id_parent': '0'},
 {'id': '5', 'name': 'title5', 'id_parent': '4'}]