This article mainly introduces the PHP tree menu code based on recursive implementation. It uses a recursive method to traverse nodes to construct a tree menu. It is a very practical technique. Friends who need it can refer to it
The example in this article describes the PHP tree menu code based on recursive implementation. Share it with everyone for your reference. The specific implementation method is as follows:
When developing an e-commerce website, we made this function to display a tree menu, using the PHP tree menu function implemented recursively. The specific code is as follows:
The code is as follows:
public function procCategory($sid,$pid){ $return = array(); $key = 0; static $arr = array(); //分类级别参考数组 $sql = "select cid,pcid,name from shop_goods_catalog where sid='{$sid}' and pcid = '{$pid}'"; $result = $this->db->query($sql); while($row=$this->db->fetchArray($result)){ $nbsp = ''; if($row['pcid']==0){ $arr = array(); } $arr[] = $row['pcid']; //顶级分类不添加树形结构标识。 if($row['pcid']>0){ //根据分类级别添加树形结构标识 $key = array_search($row['pcid'],$arr); for($i=0;$i<$key;$i++){ $nbsp .= ' '; } //重构分类级别参考数组 if(count($arr)>1&&count(array_keys($arr,$row['pcid']))>1){ $arr = array_slice($arr,0,$key+1); } } $row['name'] = $nbsp.$row['name']; $row['level'] = $key; //分类级别,0为顶级分类,1为二级分类,用于样式设定或其他需求 $return[] = $row; $r = $this->procCategory($sid,$row['cid']); $return = array_merge($return,$r); } return $return; }
Since the efficiency of recursion is relatively low, if you focus on program efficiency, do not use this method, or do Improved use of this method.
The following is the php tree Unlimited classification code, friends in need can refer to it.
<?php /** by lenush; */ class Tree { var $data = array(); var $child = array(-1=>array()); var $layer = array(-1=>-1); var $parent = array(); function Tree ($value) { $this->setNode(0, -1, $value); } // end func function setNode ($id, $parent, $value) { $parent = $parent?$parent:0; $this->data[$id] = $value; $this->child[$id] = array(); $this->child[$parent][] = $id; $this->parent[$id] = $parent; if (!isset($this->layer[$parent])) { $this->layer[$id] = 0; } else { $this->layer[$id] = $this->layer[$parent] + 1; } } // end func function getList (&$tree, $root= 0) { foreach ($this->child[$root] as $key=>$id) { $tree[] = $id; if ($this->child[$id]) $this->getList($tree, $id); } } // end func function getValue ($id) { return $this->data[$id]; } // end func function getLayer ($id, $space = false) { return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id]; } // end func function getParent ($id) { return $this->parent[$id]; } // end func function getParents ($id) { while ($this->parent[$id] != -1) { $id = $parent[$this->layer[$id]] = $this->parent[$id]; } ksort($parent); reset($parent); return $parent; } // end func function getChild ($id) { return $this->child[$id]; } // end func function getChilds ($id = 0) { $child = array($id); $this->getList($child, $id); return $child; } // end func } // end class //new Tree(根目录的名字); //根目录的ID自动分配为0 $Tree = new Tree('目录导航'); //setNode(目录ID,上级ID,目录名字); $Tree->setNode(1, 0, '目录1'); $Tree->setNode(2, 1, '目录2'); $Tree->setNode(3, 0, '目录3'); $Tree->setNode(4, 3, '目录3.1'); $Tree->setNode(5, 3, '目录3.2'); $Tree->setNode(6, 3, '目录3.3'); $Tree->setNode(7, 2, '目录2.1'); $Tree->setNode(8, 2, '目录2.2'); $Tree->setNode(9, 2, '目录2.3'); $Tree->setNode(10, 6, '目录3.3.1'); $Tree->setNode(11, 6, '目录3.3.2'); $Tree->setNode(12, 6, '目录3.3.3'); //getChilds(指定目录ID); //取得指定目录下级目录.如果没有指定目录就由根目录开始 $category = $Tree->getChilds(); //遍历输出 foreach ($category as $key=>$id) { echo $Tree->getLayer($id, '|-').$Tree->getValue($id)."<br />\n"; } ?>
The above is the detailed content of php tree menu example code. For more information, please follow other related articles on the PHP Chinese website!