``` <?php //從數據庫中取出的分類數據 $original_array( array( 'id' => 1, 'pid' => 0, 'name' => '新聞分類' ), array( 'id' => 2, 'pid' => 0, 'name' => '最新公告' ), array( 'id' => 3, 'pid' => 1, 'name' => '國內新聞' ), array( 'id' => 4, 'pid' => 1, 'name' => '國際新聞' ), array( 'id' => 5, 'pid' => 0, 'name' => '圖片分類' ), array( 'id' => 6, 'pid' => 5, 'name' => '新聞圖片' ), array( 'id' => 7, 'pid' => 5, 'name' => '其它圖片' ), ), //整理后的分類數據 $output_array = array( array( 'id' => 1, 'pid' => 0, 'name' => '新聞分類', 'children' => array( array( 'id' => 3, 'pid' => 1, 'name' => '國內新聞' ), array( 'id' => 4, 'pid' => 1, 'name' => '國際新聞' ), ), ), array( 'id' => 2, 'pid' => 0, 'name' => '最新公告', ), array( 'id' => 5, 'pid' => 0, 'name' => '圖片分類', 'children' => array( array( 'id' => 6, 'pid' => 5, 'name' => '新聞圖片' ), array( 'id' => 7, 'pid' => 5, 'name' => '其它圖片' ), ), ), ); //整理函數 /** * 生成無限級樹算法 * @author Baiyu 2014-04-01 * @param array $arr 輸入數組 * @param number $pid 根級的pid * @param string $column_name 列名,id|pid父id的名字|children子數組的鍵名 * @return array $ret */ function make_tree($arr, $pid = 0, $column_name = 'id|pid|children') { list($idname, $pidname, $cldname) = explode('|', $column_name); $ret = array(); foreach ($arr as $k => $v) { if ($v [$pidname] == $pid) { $tmp = $arr [$k]; unset($arr [$k]); $tmp [$cldname] = make_tree($arr, $v [$idname], $column_name); $ret [] = $tmp; } } return $ret; } //整理函數的使用 $output_array = make_tree($original_array); ```