无限极分类

第一种

public function catetree($cateRes){
    return $this->sort($cateRes);
}

public function sort($cateRes,$pid=0,$level=0){

    static $arr=array();
    foreach ($cateRes as $k => $v) {
        if($v['pid']==$pid){
            $v['level']=$level;
            $arr[]=$v;
            $this->sort($cateRes,$v['id'],$level+1);
        }
    }

    return $arr;
} 

第二种

 public static function tree($data){
        $tree = [];

        foreach ($data as $value) {
            $tree[$value['id']] = $value;
        }

        foreach ($tree as $key => $value)
            $tree[$value['pid']]['son'][] = &$tree[$key]; //引用
        $tree = isset($tree[0]['son']) ? $tree[0]['son'] : array();

        return $tree;
    }

点击链接加入群聊【PHP菜鸟集中营】：技术交流群