php tree 非递归,PHP-树形结构数据转换成php数组，递归和非递归算法

sql遍历得出所有数据到$results里

SELECT id,title, lft, rgt FROM tablename ORDER BY lft ASC

生成树状数组：

function create_tree ($results) {$rgt=0;

$return = $results[0];

array_shift($results);

if ($return['lft'] + 1 == $return['rgt'])

$return['leaf'] = true;

else {

foreach ($results as $key => $result) {

if ($result['lft'] > $return['rgt']) //not a child

break;

if ($rgt > $result['lft']) //not a top-level child

continue;

$return['children'][] = create_tree(array_values($results));

foreach ($results as $child_key => $child) {

if ($child['rgt'] < $result['rgt'])

unset($results[$child_key]);

}

$rgt = $result['rgt'];

unset($results[$key]);

}

}

unset($return['lft'],$return['rgt']);

return $return;

}

$tree = create_tree($results);