生成树：
function listToTree($list, $pk = 'fid', $pid = 'pid', $child = 'children', $root = 0) {
$tree = array();
if (is_array($list)) {
$refer = array();
foreach ($list as $key => $data) {
$refer[ $data[ $pk ] ] = &$list[ $key ];
}
foreach ($list as $key => $data) {
// 判断是否存在parent
$parentId = $data[ $pid ];
if ($root == $parentId) {
$tree[] = &$list[ $key ];
} else {
if (isset($refer[$parentId])) {
$parent = &$refer[ $parentId ];
$parent[ $child ][ $data[ $pk ] ] = &$list[ $key ];
$parent[ $child ] = array_values($parent[ $child ]);
}
}
}
}
return $tree;
}
树形结构解除：
function treetoarray($array){
$arr = array();
if(is_array($array) && !empty($array)){
foreach($array as $w) {
//有子集,继续分类
if(isset($w['children']) && !empty($w['children'])) {
$t = $w['children'];
unset($w['children']);
$arr[] = $w;
if(is_array($t)){
$arr = array_merge($arr,tree2array($t));
}
} else {
unset($w['children']);
$arr[] = $w;
}
}
return $arr;
}else{
return false;
}
}
