如何在laravel中循环并获取无限个父子树数据的值

// 定义递归函数
function getTreeValue($tree, $parentId = 0, $prefix = '') {
    $result = [];

    foreach ($tree as $node) {
        if ($node['parent_id'] == $parentId) {
            $node['name'] = $prefix . $node['name'];
            $result[] = $node;

            // 递归调用自身，获取子节点
            $children = getTreeValue($tree, $node['id'], $prefix . '--');
            $result = array_merge($result, $children);
        }
    }

    return $result;
}

// 获取父子树数据
$treeData = [
    ['id' => 1, 'name' => 'Node 1', 'parent_id' => 0],
    ['id' => 2, 'name' => 'Node 1.1', 'parent_id' => 1],
    ['id' => 3, 'name' => 'Node 1.1.1', 'parent_id' => 2],
    ['id' => 4, 'name' => 'Node 2', 'parent_id' => 0],
    ['id' => 5, 'name' => 'Node 2.1', 'parent_id' => 4],
    ['id' => 6, 'name' => 'Node 2.1.1', 'parent_id' => 5],
];

$result = getTreeValue($treeData);

// 打印结果
foreach ($result as $node) {
    echo $node['name'] . "\n";
}