php之 数组实现菜单无限极分类

参考链接
https://blog.csdn.net/qq_36025814/article/details/105814594

实现 传入1个大数组， 返回 层级式结构的数组

//递归处理数据
function generateTree($list, $pk = 'id', $pid = 'pid', $child = '_child', $root = 0)
{
    $tree     = array();
    $packData = array();
    foreach ($list as $data) {
        $packData[$data[$pk]] = $data;
    }

    foreach ($packData as $key => $val) {
        if ($val[$pid] == $root) {
            $tree[] = &$packData[$key]; //代表跟节点, 重点一
        } else {
            $packData[$val[$pid]][$child][] = &$packData[$key]; //找到其父类,重点二
        }
    }
    return $tree;
}