php 树排序,php数组树排序

我有以下数组。它有一个与id对应的父id。我设法创建一个函数来排序,并将此数组转换为树数组。我的问题是,如果父母在照看孩子,有时这种方法就不能正常工作。

那么,如何将下面这样的数组转换为不需要首先排序的树呢?

[0] => Array

(

[menu] =>

[parent] => 0

[id] => 1

)

,

[1] => Array

(

[menu] =>

[parent] =>

[id] => 2

)

,

[2] => Array

(

[menu] =>

[parent] => 1

[id] => 3

)

,

[3] => Array

(

[menu] =>

[parent] => 1

[id] => 4

)

,

[4] => Array

(

[menu] =>

[parent] => 4

[id] => 5

)

我的这个功能不能正常工作:

function page_tree($rows) {

if(!is_array($rows) || empty($rows) ){

return false;

}

// $rows = array(); //stores all the database rows that are to be converted into a tree

$tree = array(); //stores the tree

$tree_index = array(); //an array used to quickly find nodes in the tree

$id_column = "id"; //The column that contains the id of each node

$parent_column = "parent"; //The column that contains the id of each node's parent

$text_column = "title"; //The column to display when printing the tree to html

//build the tree - this will complete in a single pass if no parents are defined after children

// vp(count($rows) );die();

// while(count($rows) > 0){

foreach($rows as $row_id => $row){

$row_id = $row['id'];

if($row[$parent_column]){

if((!array_key_exists($row[$parent_column], $rows)) and (!array_key_exists($row[$parent_column], $tree_index))){

unset($rows[$row_id]);

}

else{

if(array_key_exists($row[$parent_column], $tree_index)){

$parent = & $tree_index[$row[$parent_column]];

$parent['children'][$row_id] =$row;

$parent['children'][$row_id]["children"] = array();

$tree_index[$row_id] = & $parent['children'][$row_id];

unset($rows[$row_id]);

}

}

}

else{

$tree[$row_id] = $row;

$tree[$row_id]["children"] = array();

$tree_index[$row_id] = & $tree[$row_id];

unset($rows[$row_id]);

}

}

// }

return $tree;

}

请注意:父项为(空)时(='';)表示它是根。