Include (move multiple nodes; move a single node; delete multiple nodes; delete a single node; add a new node), and attach the database table structure~ If you have any questions, you can leave a message ( www.webyang.net ).
1. db sql statement
//db used for php unlimited classification
create table tree(
id int(10) not null primary key auto_increment,
name varchar(255) not null,
lft int(10) not null default 0,
rgt int(10) not null default 0,
status int(1) not null default 0,
index lft (`lft`),
index rgt (`rgt`),
index status(`status`)
)charset utf8;
insert into tree value (null,'Food',1,18,0);
insert into tree value (null,'Fruit',2,11,0);
insert into tree value (null,'Red',3,6,0);
insert into tree value (null,'Cherry',4,5,0);
insert into tree value (null,'Yellow',7,10,0);
insert into tree value (null,'Banana',8,9,0);
insert into tree value (null,'Meat',12,17,0);
insert into tree value (null,'Beef',13,14,0);
insert into tree value (null,'Pork',15,16,0);
2. php file
<?php
error_reporting(0);
/*
1 Food 18
+------------------------------+
2 Fruit 11 12 Meat 17
+-------------+ +------------+
3 Red 6 7 Yellow 10 13 Beef 14 15 Pork 16
4 Cherry 5 8 Banana 9
descendants = (right – left - 1) / 2
*/
/**
* for moving a node (including child nodes)
*@param array $pdata = array('id'=>primary key, 'root'=>name) Choose one parent node (when empty, insert the largest parent node)
*@param array $ndata = array('id'=>primary key, 'root'=>name) Two select a sibling node (not needed when there is no sibling)
*@param array $cdata = array('id'=>primary key, 'root'=>name) Choose one of the nodes currently to be moved
*/
function move_tree_all($pdata=array(),$ndata=array(),$cdata=array()) {
$cid = $cdata['id'] ? intval($cdata['id']) : '';
$croot = $cdata['root'];
if(!$cid && !$croot) return;
//Need to add judgment
//1, cdata cannot be the top level
//2, cdata cannot be higher than $pdata level
$adata = get_tree_all($cdata); //Get all nodes of the current mobile node
delete_tree_all($cdata,1); //To logically delete all nodes of the currently moved node
foreach($adata as $k => $val) {
if($k != 0) {
$pdata = array('root'=>$val['parent']);
insert_tree($pdata,'',$val['name'],1);
} else { //first
insert_tree($pdata,$ndata,$val['name'],1);
}
}
}
/**
* for moving a node (excluding child nodes)
*@param array $pdata = array('id'=>primary key, 'root'=>name) Choose one parent node (when empty, insert the largest parent node)
*@param array $ndata = array('id'=>primary key, 'root'=>name) Two select a sibling node (not needed when there is no sibling)
*@param array $cdata = array('id'=>primary key, 'root'=>name) Choose one of the nodes currently to be moved
*/
function move_tree_item($pdata=array(),$ndata=array(),$cdata=array()) {
$cid = $cdata['id'] ? intval($cdata['id']) : '';
$croot = $cdata['root'];
if(!$cid && !$croot) return;
//Need to add judgment
//1, cdata cannot be the top level
if(!$croot) {
$sql = "SELECT name from tree where id = $cid";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
$croot = $row['name'];
unset($sql);
}
delete_tree_item($cdata,1);
insert_tree($pdata,$ndata,$croot,1);
}
/**
* for inserting a node
*@param array $pdata = array('id'=>primary key, 'root'=>name) Choose one parent node (when empty, insert the largest parent node)
*@param array $ndata = array('id'=>primary key, 'root'=>name) Two select a sibling node (not needed when there is no sibling)
*@param string $name string newly inserted name
*@param int $update is empty by default, update insert when it is 1
*/
function insert_tree($pdata=array(),$ndata=array(),$name,$update='') {
if(!$name) return;
$pid = $pdata['id'] ? intval($pdata['id']) : '';
$proot = $pdata['root'];
$ nid = $ ndata ['id']? intval ($ ndata ['id']): '';
$ nroot = $ ndata ['root'];
//Has father and no brother (the smallest child node, the last son of the parent node)
if(($pid || $proot) && !($nid || $nroot)) {
$sql = $pid ? "SELECT lft, rgt FROM tree WHERE id = '{$pid}';" : "SELECT lft, rgt FROM tree WHERE name = '{$proot}';";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
unset($sql);
//new node
$lft = $row['rgt'];
$rgt = $lft+1;
if(!$update) {
$sql = "insert into tree values (null,'{$name}',$lft,$rgt,0);";
$sql1 = "update tree set rgt = rgt+2 where rgt >= {$row['rgt']}";
$sql2 = "update tree set lft = lft+2 where lft >= {$row['rgt']}";
} else {
$sql = "update tree set lft=$lft,rgt=$rgt,status=0 where name ='{$name}';";
$sql1 = "update tree set rgt = rgt+2 where status =0 and rgt >= {$row['rgt']}";
$sql2 = "update tree set lft = lft+2 where status =0 and lft >= {$row['rgt']}";
}
mysql_query($sql1);
mysql_query($sql2);
mysql_query($sql); //last add new data
}
//has father and brother
if(($pid || $proot) && ($nid || $nroot)) {
$sql = $nid ? "SELECT lft, rgt FROM tree WHERE id = '{$nid}';" : "SELECT lft, rgt FROM tree WHERE name = '{$nroot}';";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
unset($sql);
//new node
$lft = $row['lft'];
$rgt = $lft+1;
if(!$update) {
$sql = "insert into tree values (null,'{$name}',$lft,$rgt,0);";
$sql1 = "update tree set rgt = rgt+2 where rgt >= {$row['lft']};";
$sql2 = "update tree set lft = lft+2 where lft >= {$row['lft']};";
} else {
$sql = "update tree set lft=$lft,rgt=$rgt,status=0 where name ='{$name}';";
$sql1 = "update tree set rgt = rgt+2 where status = 0 and rgt >= {$row['lft']};";
$sql2 = "update tree set lft = lft+2 where status = 0 and lft >= {$row['lft']};";
}
mysql_query($sql1);
mysql_query($sql2);
mysql_query($sql); //last add new data
}
//No father and no brother (big brother)
if(!($pid || $proot) && !($nid || $nroot)) {
$sql = "SELECT max(`rgt`) as rgt FROM tree;";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
unset($sql);
//new node
$lft = 1;
$rgt = $row['rgt']+2;
if(!$update) {
$sql = "insert into tree values (null,'{$name}',$lft,$rgt,0);";
$sql1 = "update tree set rgt = rgt+1";
$sql2 = "update tree set lft = lft+1";
} else {
$sql = "update tree set lft=$lft,rgt=$rgt,status=0 where name ='{$name}';";
$sql1 = "update tree set rgt = rgt+1 where status = 0";
$sql2 = "update tree set lft = lft+1 where status = 0";
}
mysql_query($sql1);
mysql_query($sql2);
mysql_query($sql); //last add new data
}
}
/**
* Used to delete a node (including child nodes)
*@param array $data = array('id'=>primary key, 'root'=>name) choose one
*@param int $update is empty by default, tombstone is deleted when it is 1
*/
function delete_tree_all($data,$update='') {
$id = $data['id'] ? intval($data['id']) : '';
$root = $data['root'];
if(!$id && !$root) return;
$sql = $id ? "SELECT lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT lft, rgt FROM tree WHERE name = '{$root}';";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
unset($sql);
$middle = $row['rgt']-$row['lft']+1;
if(!$update) {
$sql = "delete from tree where lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."'";
$sql1 = "update tree set rgt = rgt-{$middle} where rgt > {$row['rgt']}";
$sql2 = "update tree set lft = lft-{$middle} where lft > {$row['rgt']}";
} else {
$sql = "update tree set status = 1 where lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."'";
$sql1 = "update tree set rgt = rgt-{$middle} where status=0 and rgt > {$row['rgt']}";
$sql2 = "update tree set lft = lft-{$middle} where status=0 and lft > {$row['rgt']}";
}
mysql_query($sql);
mysql_query($sql1);
mysql_query($sql2);
}
/**
* used to delete a node (excluding child nodes)
*@param array $data = array('id'=>primary key, 'root'=>name) choose one
*@param int $update is empty by default, tombstone is deleted when it is 1
*/
function delete_tree_item($data,$update='') {
$id = $data['id'] ? intval($data['id']) : '';
$root = $data['root'];
if(!$id && !$root) return;
$sql = $id ? "SELECT id,lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT id,lft, rgt FROM tree WHERE name = '{$root}';";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
unset($sql);
if(!$update) {
$sql = "delete from tree where id = {$row['id']};";
$sql1 = "update tree set rgt = rgt-1,lft = lft -1 where lft > {$row['lft']} and rgt < {$row['rgt']}";
$sql2 = "update tree set lft = lft-2 where lft > {$row['rgt']}";
$sql3 = "update tree set rgt = rgt-2 where rgt > {$row['rgt']}";
} else {
$sql = "update tree set status = 1 where id = {$row['id']};";
$sql1 = "update tree set rgt = rgt-1,lft = lft -1 where status = 0 and lft > {$row['lft']} and rgt < {$row['rgt']}";
$sql2 = "update tree set lft = lft-2 where status = 0 and lft > {$row['rgt']}";
$sql3 = "update tree set rgt = rgt-2 where status = 0 and rgt > {$row['rgt']}";
}
mysql_query($sql);
mysql_query($sql1);
//can do or not do just right,but not do load empty 2 number in middle
mysql_query($sql2);
mysql_query($sql3);
}
/**
* used to get all nodes
*@param array $data = array('id'=>primary key, 'root'=>name) choose one
*/
function get_tree_all($data) {
$id = $data['id'] ? intval($data['id']) : '';
$root = $data['root'];
if(!$id && !$root) return;
$sql = $id ? "SELECT lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT lft, rgt FROM tree WHERE name = '{$root}';";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
$adata = array(); //all data
$right = array(); //count
$prev = array();
$result = mysql_query("SELECT id,name, lft, rgt FROM tree WHERE lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."' ORDER BY lft ASC ;");
while ($row = mysql_fetch_assoc($result)) {
if (count($right) > 0) {
while ($right[count($right) - 1] < $row['rgt']) { // Check if we should move the node off the stack
array_pop($right);
array_pop($prev);
}
}
$parent = $prev ? end($prev) : '';
$adata[] = array('id'=>$row['id'],'name'=>$row['name'],'level'=>count($right),'parent'=>$parent);
$right[] = $row['rgt'];
$prev[] = $row['name'];
}
return $adata;
}
/**
*For display classification
*@param array $data = array('id'=>primary key, 'root'=>name) choose one
*/
function display_tree($data) {
$id = $data['id'] ? intval($data['id']) : '';
$root = $data['root'];
if(!$id && !$root) return;
$sql = $id ? "SELECT lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT lft, rgt FROM tree WHERE name = '{$root}';";
$result = mysql_query($sql);
$row = mysql_fetch_assoc($result);
$right = array();
$result = mysql_query("SELECT name, lft, rgt FROM tree WHERE lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."' ORDER BY lft ASC ;");
while ($row = mysql_fetch_assoc($result)) {
if (count($right) > 0) { // check if we should move the node off the stack
while ($right[count($right) - 1] < $row['rgt']) {
array_pop($right);
}
}
echo str_repeat(' ',count($right)) . $row['name'] . "\n";
$right[] = $row['rgt'];
}
}
mysql_connect('localhost','root','') or die('connect error');
mysql_select_db('test') or die('database error');
mysql_query('set names utf8');
display_tree(array('root'=>'Food'));
//display_tree(array('root'=>'bigboss'));
//move_tree_all($pdata=array('root'=>'Fruit'),$ndata=array('root'=>'Red'),$cdata=array('root'=>'Meat'));
//move_tree_all('','',$cdata=array('root'=>'Meat'));
//move_tree_item('','',array('root'=>'Red'));
//move_tree_item(array('root'=>'Red'),array('root'=>'Cherry'),array('root'=>'Fruit'));
//delete_tree_all(array('root'=>'Yellow'));
//delete_tree_all(array('root'=>'Meat'));
//delete_tree_item(array('root'=>'Meat'));
//insert_tree('','','bigboss');
//insert_tree(array('root'=>'Red'),'','dalao');
//insert_tree(array('root'=>'Red'),array('root'=>'Cherry'),'baddalao');
//insert_tree(array('root'=>'Fruit'),array('root'=>'Red'),'Redbother');
display_tree(array('root'=>'Food'));