<?php
function getTree($treeByParent, $treeByCat, $id, $lastId) {
$gTree = [];
if ($id != $lastId) {
$gTree[] = $id;
if ( isset($treeByCat[ $id ]) && count($treeByCat[ $id ]) > 0 ) $gTree = array_merge( getTree($treeByParent, $treeByCat, $treeByCat[ $id ], $id), $gTree);
if ( isset($treeByParent[ $id ]) && count($treeByParent[ $id ]) > 0 ) {
foreach ($treeByParent[ $id ] as $cat) {
$gTree = array_merge( getTree($treeByParent, $treeByCat, $cat, $id), $gTree);
}
}
return $gTree;
}
}
function display_parent_nodes($tree, $id)
{
$current = $tree[$id];
$parent_id = $current === NULL ? "NULL" : $current;
$parents = array();
$parents[] = $parent_id;
while (isset($tree[$parent_id])) {
$current = $tree[$parent_id];
$parent_id = $current === NULL ? "NULL" : $current;
$parents[] = $parent_id;
}
echo implode(" > ", array_reverse($parents));
}
$treeByParent = array(
0 => array(1, 2),
1 => array(3, 7),
3 => array(4),
4 => array(5),
5 => array(6, 8)
);
$treeByCat = array(
1 => 0,
2 => 0,
3 => 1,
7 => 1,
4 => 3,
5 => 4,
6 => 5,
8 => 5
);
print_r( display_parent_nodes($treeByCat, 4) );
//print_r( getTree($treeByParent, $treeByCat, 4, 0) );
preferences:
34.14 ms | 402 KiB | 5 Q