【踩坑】PHP无限极分类

//方法
private function GetTree($arr,$pid,$step){
    global $tree;
    foreach($arr as $key=>$val) {
        if($val['pid'] == $pid) {
            $flg = str_repeat('└―',$step);
            $val['name'] = $flg.$val['name'];
            $tree[] = $val;
            $this->GetTree($arr , $val['cid'] ,$step+1);
        }
    }
    return $tree;
}

//调用
$newarr = $this->GetTree($arr, 0, 0);

php实现无限极分类_php 无限极分类-CSDN博客