This article mainly introduces the PHP recursive method to implement infinite classification instance code, the need for friends can refer to the following
Array: Code as follows: $items = Array ( array (' id ' => 1, ' pid ' => 0, ' name ' => ' Level One '), array (' id ' => 1 1, ' pid ' => 0, ' name ' => ' www.jb51.net level '), array (' id ' => 2, ' pid ' => 1, ' name ' => ' two class '), &nbs P;array (' id ' =>, ' pid ' =>, ' name ' => ' Level Two '), array (' ID ' => 3, ' pid ' => 1, ' name ' => ' two level 23 ') ), array (' id ' =>, ' pid ' =>, ' name ' => ' Level Two '), array (' id ' =>, ' pid ' =>, ' name ' =& Gt ' Level three '), array (' id ' => 9, ' pid ' => 1, ' name ' => ' two level 25 '); functions: Code as follows: function Formattree ($array, $pid = 0) { $arr = array (); $tem = Array (); fo Reach ($array as $v) { if ($v [' pid '] = = $pid) { $tem = Formattree ($array, $v [' id ']); &NB Sp //Determine if there is a sub array $tem && $v [' son '] = $tem; $arr [] = $v; } return $arr; }