php无限极分类实现

    public function test123()
    {
        $dep = Db::name('department')->where(['company_id'=>2])->select();
        $my_tree = $this->tree($dep);
        print_r($my_tree);die;
    }
    public function tree($data,$id = 0)
    {
        $new_arr = [];
        foreach($data as $k => $v){
            if($v['pid'] == $id)
            {
                $son = $this->tree($data, $v['id']);
                if($son){
                    $v['son'] = $son;
                }
                $new_arr[] = $v;
            }
        }
        return $new_arr;
    }

如果数据库没有数据，也可以用测试数据，然后调用tree方法即可

$data = array(
    array('id'=>1,'name'=>'电脑','pid'=>0),
    array('id'=>2,'name'=>'手机','pid'=>0),
    array('id'=>3,'name'=>'笔记本','pid'=>1),
    array('id'=>4,'name'=>'台式机','pid'=>1),
    array('id'=>5,'name'=>'智能机','pid'=>2),
    array('id'=>6,'name'=>'功能机','pid'=>2),
    array('id'=>7,'name'=>'超级本','pid'=>3),
    array('id'=>8,'name'=>'游戏本','pid'=>3),
);