Ask about the deletion algorithm of a tree node. let's take a look at the implementation of a php algorithm. the implementation is as follows: store a tree like Table 1 in the form of table 2 in a database table, how can I delete a subtree (for example, a Red subtree? Food | -- Fruit | ---- Green | ------ Pear | ---- Red | ------ Cherry | ------ Apple |-you can refer to a tree node deletion algorithm.
Evaluate the implementation of a php algorithm as follows:
Store a tree like Table 1 as Table 2 in a database table. what should I do if I want to delete a subtree (for example, I want to delete the Red subtree?
Food
| -- Fruit
| ---- Green
| ------ Pear
| ---- Red
| ------ Cherry
| ------ Apple
| ---- Yellow
| ------ Banana
| -- Meat
| ---- Mutton
| ---- Beef
| ---- Pork
(Table 1)
ID parent title
1 Food
2 Food Fruit
3 Fruit Green
4 Green Pear
5 Fruit Red
6 Red Cherry
7 Fruit Yellow
8 Yellow Banana
9. Food Meat
10 Meat Mutton
11 Meat Beef
12 Meat Pork
13 Red Apple
(Table 2)
------ Solution --------------------
Recursion
