无限极分类--递归法

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

/**     * 无限极分类     * @param array $data 可迭代数组     * @param int $pid 父级id     * @return array     */    public static function getTree(array $data,$pid = 0): array    {        $tree = [];        foreach ($data as &$item){            if ($item['pid'] === $pid){                $item['children'] = self::getTree($data,$item['id']);                $tree[] = $item;            }        }        return $tree;    }