python全栈笔记-day06-递归练习

#递归练习

menus = [
    {'text':'北京','children':[
        {'text':'朝阳','children':[]},
        {'text':'昌平','children':[
            {'text':'沙河','children':[]},
            {'text':'回龙观','children':[]}
            ]
        }]
    },
    {'text':'上海','children':[
        {'text':'宝山','children':[]},
        {'text':'金山','children':[]}
    ]
    }
]

#1.打印所有节点
#2.输入一个节点的名字，沙河，遍历找，找到了，打印它，并返回True

# def print_all(list):
#     for i in list:
#         print(i['text'])
#         print_all(i['children'])
#
# print_all(menus)

def search(str,list):
    for i in list:
        if i['text'] == str:
            print(i['text'])
            r = True
        search(str,i['children'])

node = '沙河'

print(search(node,menus))