- 递归算法
function getTree($array, $pid =0, $level = 0)
{
static $list = [];
foreach ($array as $key => $value) {
if ($value['pid'] == $pid) {
$value['level'] = $level;
$list[] = $value;
unset($array[$key]);
getTree($array, $value['id'], $level+1);
}
}
return $list;
}
- 引用算法
function getTree($array)
{
$items = [];
foreach($array as $value) {
$items[$value['id']] = $value;
}
$tree = [];
foreach($items as $key => $value) {
if(isset($items[$item['pid']])) {
$items[$item['pid']]['son'][] = &$items[$key];
} else {
$tree[] = &$items[$key];
}
}
return $tree;
}