简单实现【递归】

$items = array( array('id' => 1, 'pid' => 0, 'name' => '大山' ), array('id' => 11, 'pid' => 0, 'name' => '大海' ), array('id' => 2, 'pid' => 1, 'name' => '泰山' ), array('id' => 10, 'pid' => 11, 'name' => '黄海' ), array('id' => 3, 'pid' => 1, 'name' => '黄山' ), array('id' => 12, 'pid' => 11, 'name' => '中国南海' ), array('id' => 13, 'pid' => 12, 'name' => '三沙市' ), array('id' => 9, 'pid' => 1, 'name' => '喜马拉雅山' ),);function formatTree($array, $pid = 0){ $arr = array(); $tem = array(); foreach ($array as $v) {  if ($v['pid'] == $pid) {   $tem = formatTree($array, $v['id']);     //判断是否存在子数组   $tem && $v['son'] = $tem;   $arr[] = $v;  } } return $arr;}print_r(formatTree($items));