php递归实现无限级分类树
1.首先查出所有数据
就不列出查询过程。展示数据类型:
2.
$data = sele_chil($results,0);
function sele_chil($results, $pId){
$tree = '';
foreach($results as $k => $v){
if($v['PARENTID'] == $pId){
$v['children'] = sele_chil($results, $v['CHANNELID']);
$tree[] = $v;
unset($results[$k]);
}
}
return $tree;
}
echo "<pre>";
print_r($data);
echo "</pre>"
打印结果为: