PHP树的代码,可以嵌套任意层

PHP树的代码,可以嵌套任意层?file://建立树的主要函数,传递的参数为根节点的编号和根节点的标题function
create_tree($rootid,$roottilte){print_parent_from_rootsortid($rootid,$roottilte);}file://打印根节点div头的函数function
print_parent_from_rootsortid($rootid,$roottilte){$parent_fullname=”R”.$rootid.”Parent”;
file://div
父级区别标志$parent_.$rootid;$parent_pic=”R”.$rootid.”img”;echo ” DIV
class=parent id=$parent_fullnameA href=/”#/”
onclick=/”expandIt(‘$parent_id’); return false/”IMG border=0 height=13
id=$parent_pic src=/”image/folderclosed000.gif/”
width=19$roottilte/A/DIV”;global
$cursor_tree;$Bottom_Flag=0;$len=strlen($rootid)+2;
file://子级编码为父级编码长度加2$query = “SELECT
ResourceSortNo,ResourceSortName,SectionBottomFlag From TbSort Where
length(ResourceSortNo)=$len and ResourceSortNo like ‘$rootid%'”;
file://sql查询语句ora_parse($cursor_tree, $query) or
die;ora_exec($cursor_tree);$child_fullname=”R”.$rootid.”Child”;
file://div 子级区别标志echo “DIV class=child id=$child_fullname”;
file://打印一个div子级头while(ora_fetch($cursor_tree)){ $Sort_No=
trim(ora_getcolumn($cursor_tree,0)); $Sort_Title =
trim(ora_getcolumn($cursor_tree,1)); $Bottom_澳门新葡萄京官网首页 ,Flag=
trim(ora_getcolumn($cursor_tree,2));
print_child_from_rootsortid($Sort_Title,$Sort_No, $Bottom_Flag);
file://循环调用打印子级编码函数}echo
“/DIV”;}file://判断是否是末级标志,并且打印子级编码的函数function
print_child_from_rootsortid($Section_Title,$Section_No,$Bottom_Flag){global
$num;$len=2*$num+2;for($j=0;$j$len;$j++){ echo “&nbsp”;}
file://输出节点之间间距空格的循环if($Bottom_Flag==1){ echo ” IMG
border=0 height=13 src=/”image/folderclosed000.gif/” width=19 A href=/””
target=forum$Section_Title/ABR”;}else{ $p_.$Section_No;
$p_pic=”R”.$Section_No.”img”; echo ” IMG border=0 height=13 id=$p_pic
src=/”image/folderclosed000.gif/” width=19 A href=/””
onclick=/”expandIt(‘$p_id’); return false/”$Section_Title/ABR”;
$child_fullname=”R”.$Section_No.”Child”; echo “DIV class=child
id=$child_fullname”; file://打印div子标志头
find_allchild_from_rootsortid($Section_No);
file://查找子级别内容—–嵌套递归函数甲 echo “/DIV”;
file://打印div子标尾部}}file://查询所有子级编码的函数function
find_allchild_from_rootsortid($Section_No){global
$handle,$num;$num++;$cursor_ary[$num] =
ora_open($handle);$len=strlen($Section_No)+2;
file://μ?μ?×ó??±e±ào?3¤?è$query = “SELECT
ResourceSortNo,ResourceSortName,SectionBottomFlag From TbSort Where
length(ResourceSortNo)=$len and ResourceSortNo like ‘$rootid%'”;
file://sql查询语句ora_parse($cursor_ary[$num], $query) or
die;ora_exec($cursor_ary[$num]);while(ora_fetch($cursor_ary[$num])){
$Sort_Title = trim(ora_getcolumn($cursor_ary[$num],1)); $Sort_No=
trim(ora_getcolumn($cursor_ary[$num],0)); $Bottom_Flag=
trim(ora_getcolumn($cursor_ary[$num],2));
print_child_from_rootsortid($Sort_Title,$Sort_No,$Bottom_Flag);
file://打印所有的子级节点—–嵌套递归函数乙}$num–;}?

原理简单,学过数据结构的一看就明白是什么道理了。不过今天在使用时数据中出现了子节点id(71)小于父节点id(104).导致部分子节点没被存储入数组
修改了一下

<?php教程
class tree
{
    var $data = array();
    var $child = array(-1=>array());
    var $layer = array(-1=>-1);
    var $parent = array();
    var $num = array();
 
    function setnode($id, $parent, $value,$num=0)
    {
        $parent = $parent ? $parent : 0;
 
        $this->data[$id]  = $value;
        $this->num[$id]      = $num;
        if (!isset($this->child[$id])) $this->child[$id] =
array();
        $this->child[$parent][] = $id;
        $this->parent[$id]  = $parent;
 
        if (!isset($this->layer[$parent]) && $parent == 0)
        {
           $this->layer[$id] = 0;
        }
        else
        {
            $this->layer[$id] = $this->layer[$parent] + 1;
        }
    }
 
 
    function getlist(&$tree, $root= 0)
    {
        foreach ($this->child[$root] as $key=>$id)
        {
            $tree[] = $id;
            if($this->child[$id]) $this->getlist($tree,
$id);
        }
    }
 
    function getvalue($id)
    {
  if($this->layer[$id]==0)
  {
   return $this->data[$id];
  }
  else
  {
   return $leftmar.$this->data[$id];
  }
    }
 
    function getnum($id)
    {
  return $this->num[$id];
    }
 
    function getbitvalue($id)
    {
  return $this->data[$id];
    }
 
    function getlayer($id, $space = false)
    {
        return $space ? str_repeat($space, $this->layer[$id]) :
$this->layer[$id];
    }
 
    function getparent($id)
    {
        return $this->parent[$id];
    }
 
    function getparents($id)
    {
        while ($this->parent[$id] != -1)
        {
            $id = $parent[$this->layer[$id]] =
$this->parent[$id];
        }
 
        ksort($parent);
        reset($parent);
 
        return $parent;
    }
 
    function getchild($id)
    {
        return $this->child[$id];
    }
 
    function getchilds($id = 0)
    {
        $child = array($id);
        $this->getlist($child, $id);
 
        return $child;
    }
 
    function printdata()
    {
        return $this->layer;
    }
}php树型菜单类
?>

发表评论

电子邮件地址不会被公开。 必填项已用*标注