/*
* 无限极分类
*/
function make_tree($list,$pk='id',$pid='parent_id',$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;
}
PHP无限极分类
最新推荐文章于 2022-05-31 19:25:29 发布