单一查询的递归类别？

如果树不是太大，则可以使用一些聪明的引用在PHP中构建树。

$nodeList = array();$tree     = array();$query = mysql_query("SELECt category_id, name, parent FROM categories ORDER BY parent");while($row = mysql_fetch_assoc($query)){    $nodeList[$row['category_id']] = array_merge($row, array('children' => array()));}mysql_free_result($query);foreach ($nodeList as $nodeId => &$node) {    if (!$node['parent'] || !array_key_exists($node['parent'], $nodeList)) {        $tree[] = &$node;    } else {        $nodeList[$node['parent']]['children'][] = &$node;    }}unset($node);unset($nodeList);

这将为您

$tree

children

我们已经用相当大的树（> 1000项）完成了此操作，它非常稳定并且比在MySQL中进行递归查询要快得多。