算法实现
<?php
function tree($list,$pid=0){
$tree=array();
foreach($list as $value){
if($value['pid']==$pid){
$tree[$value['id']]=$value;
$tree[$value['id']]['child']=tree($list,$value['id']);
}
}
return $tree;
}
$list=array(
array(
'id'=>1,
'pid'=>0,
'name'=>'IT技术',
),
array(
'id'=>2,
'pid'=>0,
'name'=>'智能手机',
),
array(
'id'=>3,
'pid'=>1,
'name'=>'编程语言',
),
array(
'id'=>4,
'pid'=>2,
'name'=>'苹果手机',
),
);
$data=tree($list,0);
var_dump($data);
?>