孙子如何表示?
100 老子 var rootNode = new Tree("rootNode","url");
\_101 儿子 treeItem["nodeid"] = tree.add(new TreeNode("nodetxt","url"));
\_103 孙子 ???
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");
依次类推.
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);";
}
}
}