无限极分类获取子孙树

无限极分类获取子孙树

<?php

$arr = [['id'=>1, 'pid'=>0], ['id'=>2, 'pid'=>1], ['id'=>3, 'pid'=>1], ['id'=>4, 'pid'=>1], ['id'=>5, 'pid'=>2],['id'=>6, 'pid'=>2],['id'=>7, 'pid'=>3], ['id'=>8, 'pid'=>7]];

function ge
8e62
tChil($arr, $id = 1, $name = 'id', $pname = 'pid'){
$child = array();
$temp = array();
do{
foreach($arr as $key => $var){
if($id == $arr[$key][$pname]){
array_push($temp, $arr[$key]);
unset($arr[$key]);
}
}
$curr = array_shift($temp);
$child[] = $curr;
$id = $curr['id'];
}while(count($temp) > 0);
return $child;
}

print_r(getChil($arr, 2));