How to realize Infinite Pole Classification spanning Tree by PHP

This article mainly introduces PHP how to achieve infinite pole classification spanning tree, has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, the following let the editor take you to understand it.

Infinite pole classification spanning tree

Function generateTree ($items) {$tree = array (); foreach ($items as $item) {if (isset ($items [$item ['pid']])) {$items [$item [' pid']] ['son'] [] = & $items [$item [' id']];} else {$tree [] = & $items [$item ['id']];} return $tree } function generateTree2 ($items) {foreach ($items as $item) $items [$item ['pid']] [' son'] [$item ['id']] = & $items [$item [' id']]; return isset ($items [0] ['son'])? $items [0] [' son']: array () } $items = array (1 = > array ('id' = > 1,' pid' = > 0, 'name' = >' Anhui'), 2 = > array ('id' = > 2,' pid' = > 0, 'name' = >' Zhejiang'), 3 = > array ('id' = > 3,' pid' = > 1, 'name' = >' Hefei'), 4 = > array ('id' = > 4,' pid' = > 3, 'name' = >' Changfeng County') 5 = > array ('id' = > 5,' pid' = > 1, 'name' = >' Anqing') Print_r (generateTree ($items)); / * how to get tree data formatted * / $tree = generateTree ($items); function getTreeData ($tree) {foreach ($tree as $t) {echo $t ['name'].

If (isset ($t ['son']) {getTreeData ($t [' son'])}} Thank you for reading this article carefully. I hope the article "how to realize the Infinite Pole Classification spanning Tree" shared by the editor will be helpful to you. At the same time, I hope you will support us, pay attention to the industry information channel, and more related knowledge is waiting for you to learn!