</a>";
echo " <a href=http://www.dvbbs.net/tech/php/delnode.php?id=".$this->items["d_id][$i]"]."><font size=2 color=red>del</font></a>";
echo "</td></tr></table>";
$i=$this->find($this->items["r_node][$i]"]);//visite right child node
$this->m_l_r_list($i);
exit;
}//if his right child node have not been visited

if($this->items["r_node][$i]"]==-1) {
$i=$this->find($this->items["f_node][$i]"]);
if(($this->items["r_node][$i]"]==$current_node)) {//his parent use right point
$this->items["r_node][$i]"]=-1;
}
if(($this->items["l_node][$i]"]==$current_node)) {//his parent use left point
$this->items["l_node][$i]"]=-1;
$this->count=$this->count-2;
}
$this->m_l_r_list($i);
exit;
}//if his right child node have been visite,up to his parent node


}
if(($this->items["f_node][$i]"]!=0)&&($this->items["l_node][$i]"]==0)&&($this->items["r_node][$i]"]==0))
{//if this node haven't child node,print it and up to his parent
 //node his parent left or right child have

上一页  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]  ... 下一页  >> 

在google里搜索更多理论上实现真正意义的无限级别菜单

	Web www.51ec.org

上一篇信息学院： 写不下了

下一篇信息学院： 这有一个测试页面执行时间的类