$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 left child node have been visite,up to his parent node


}
if(($this->items["f_node][$i]"]!=0)&&($this->items["r_node][$i]"]!=0)&&($this->items["l_node][$i]"]==0))
{//if node only have right child
$current_node=$this->items["d_id][$i]"];
$j=$this->find($this->items["f_node][$i]"]);
if($this->items["r_node][$i]"]!=-1) {
echo "<table><tr><td>";
for ($k=0;$k<$this->count;$k++) { echo " ";}
echo "<a href=../../\"main.php?d_id=".$this->items["d_id][$i]"]."\" target=\"rightframe\">".$this->items["node_value][$i]"]."</a>";
//echo $this->items["node_value][$i]"];
echo " <a href=http://www.dvbbs.net/tech/php/addnode.php?id=".$this->items["d_id][$i]"]." target=\"rightframe\"><font size=2 color=red>add</font>

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

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

	Web www.51ec.org

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

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