如何在类似树的数组列表中找到最后一个子项

def find_last_child(node):
    if not node['children']:
        return node
    else:
        last_child = None
        for child in node['children']:
            last_child = find_last_child(child)
        return last_child

# 示例使用一个类似树的数组列表
tree = [
    {
        'id': 1,
        'children': [
            {
                'id': 2,
                'children': []
            },
            {
                'id': 3,
                'children': [
                    {
                        'id': 4,
                        'children': [
                            {
                                'id': 5,
                                'children': []
                            }
                        ]
                    }
                ]
            }
        ]
    }
]

last_child = find_last_child(tree[0])
print(last_child['id'])  # 输出: 5