When writing recursive functions, you can consider caching and defining static variables to store the last running result. it is very helpful to run multiple programs. the general steps are as follows: first, fetch data from the database, put it into an array, then convert the data into a tree-like array, and finally convert the tree-like array into a technology station of its own, this article is dominated by articles. some articles are in a series, so I want to classify these articles into one class.
The database is well designed and can be categorized by id and fatherid. fatherid indicates that the parent class is the id of the article, and id is the unique id of the article. the layers are not limited and can be two layers, it can be three layers. If the fatherid is 0, it indicates the top-level article.
Php code, mainly recursion
function category_tree($fatherid){ //require_once("mysql_class/config.inc.php"); //require_once("mysql_class/Database.class.php"); $db = new Database(DB_SERVER, DB_USER, DB_PASS, DB_DATABASE); $db->connect(); $sql = "SELECT id,title,url FROM ".TABLE_TASK." WHERE fatherid=$fatherid and ispublic=1 order by id asc"; $articles = $db->query($sql); $db->close(); while ($record = $db->fetch_array($articles)){ $i = 0; if ($i == 0){ if($fatherid==0){ echo '
'; }else{ echo '
'; } } if($fatherid==0){ echo '
- ' . $record['title'].''; }else{ echo '
- ' . $record['title'].''; } category_tree($record['id']); echo '
'; $i++; if ($i > 0){ echo '
'; } }}
Call:
Category_tree (0) // extract the top-level article first
The above is all the content of this article. I hope you will like it.