function subtree($arr, $id=0, $level = 1){
$subs = array(); // 子孙树数组
foreach($arr as $v){
if($v['parent'] == $id){
$v['level'] = $level;
$subs[] = $v;
$subs = array_merge($subs, subtree($arr, $v['id'],$level+1));
}
}
return $subs;
}
function subtree($arr, $id=0, $level = 1){
static $subs = array(); //子孙数组
foreach($arr as $v){
if($v['parent']==$id){
$v['level'] = $level;
$subs[] = $v;
//递归继续查找
subtree($arr, $v['id'], $level+1);
}
}
return $subs;
}
$flag = true; //说明找到了子栏目
}
}
if($flag == false) {
array_pop($task);
$parent = end($task);
}
echo '<pre>';
print_r($task);
echo '</pre>';
}
return $tree;
}
echo '<pre>';
print_r(subtree($area, 0));
echo '</pre>';
echo '<h3>程序运行完成!</h3>';
?>
function subtree($arr, $id = 0, $lev = 1)
{
static $subs = array();
foreach ($arr as $v) {
if ($v['parent'] == $id) {
$v['lev'] = $lev;
$subs[] = $v;
subtree($arr, $v['id'], $lev + 1);
}
}
return $subs;
}
