请教: 树遍历问题 [**算法高手请进**]

[简叔]

小弟请教:
代码如下:
<?php
$sql = " select nodeid,nodetext,parentid,is_dir
from tree";
$treeData = $db->query($sql);
/*
$treeData 结构如下:
$treeData[0]["nodeid"]="100";
$treeData[0]["nodetext"]="rootNode";
$treeData[0]["parentid"]="";

$treeData[1]["nodeid"]="101";
$treeData[1]["nodetext"]="leafNode1";
$treeData[1]["parentid"]="100";
...
子子孙孙,无穷
*/
最后要得到的结果如下:
$javascript = "
var treeItem = new Array()
var rootNode = new Tree("rootNode","url");
如果是 rootnode的子node 就用 tree.add, 否则就是 treeItem["nodeid"].add()
treeItem["nodeid"] = tree.add(new TreeNode("nodetxt","url"));
";
?>

[简叔]

沉得好快,顶一下

[xuzuning]

基本框架，自己调试以下

//辅助函数，按parentid 生序排列
function sort_treeData($a, $b) {
if($a['parentid'] = $b['parentid']) return 0;
return $a['parentid'] > $b['parentid'] ? 1 : -1;
}

usort（$treeData);

$stack = array();
foreach($treeData as $key=>$value) {
if($value['parentid'] == '') {
$stack[] = array($value['nodeid'], 0);
echo 'var rootNode = new Tree("rootNode","url");';
}else {
$t = array_search($value, $stack);
$stack[] = array($value['nodeid'], 1);
if($t[1] == 0) {
echo "treeItem['$t[0]'] = tree.add(new TreeNode('$value[nodetxt]','url'));";
}else {
echo "trieeItem['$t[0]'].add(new TreeNode('$value[nodetxt]','url);";
}
}
}

[xuzuning]

孙子如何表示？
100 老子 var rootNode = new Tree("rootNode","url");
\_101 儿子 treeItem["nodeid"] = tree.add(new TreeNode("nodetxt","url"));
\_103 孙子 ？？？

[简叔]

谢谢唠叨.
\_103 孙子 trieeItem["nodeid"].add(new TreeNode("nodetxt","url");
依次类推.

[简叔]

谢谢,来测试一下