查父级,往上递归
1
2
3
4
5
6
7
8
9
10
11
12
13
14function getTree($data, $pid){
static $tree = [];
foreach ($data as $k => $v){
if ($v['pid'] == $pid){
$result = $this->getTree($data,$v['id']);
if ($result != ''){
$v['child'] = $result;
}
$tree[] = $v;
unset($data[$k]);
}
}
return $tree;
}查子集,往下递归
1
2
3
4
5
6
7
8
9
10
11
12function getTree($data, $id = 0,$lev = 0){
static $tree = [];
foreach ($data as $k => $v){
if ($v['pid'] == $id){
$v['lev'] = $lev;
$tree[] = $v;
unset($data[$k]);
getTree($data, $v['id'], $lev+1);
}
}
return $tree;
}
本博客所有文章除特别声明外,均采用 CC BY-NC-SA 4.0 许可协议。转载请注明来自 HaoGege!