<?php
class CategoryTree
{
protected $roots = [];
public function addCategory($category, $parent)
{
if ($this->categoryExists($this->roots, $category)) {
throw new InvalidArgumentException("Category: $category already exists.");
}
if ($parent === null) {
$this->roots[$category] = [];
return;
}
$node = &$this->findNode($parent, $this->roots);
if(!isset($node)) {
throw new InvalidArgumentException("Parent node: $parent not found.");
}
$node[$category] = [];
}
public function getChildren($parent)
{
$node = $this->findNode($parent, $this->roots);
if(!isset($node)) {
throw new InvalidArgumentException("Parent node: $parent not found.");
}
return array_keys($node);
}
protected function &findNode($node, &$root) {
if (in_array($node, array_keys($root))) {
return $root[$node];
}
foreach ($root as $n) {
return $this->findNode($node, $n);
}
}
protected function categoryExists($nodes, $category) {
$exists = false;
foreach($nodes as $key => $node) {
if (in_array($category, $this->getChildren($key))) {
return true;
}
$exists = $this->categoryExists($node, $category);
}
return $exists;
}
}
// For testing purposes (do not submit uncommented):
$c = new CategoryTree;
$c->addCategory('A', null);
$c->addCategory('B', 'A');
$c->addCategory('A', 'A');
echo implode(',', $c->getChildren('A'));
- Output for 5.5.0 - 5.5.38, 5.6.0 - 5.6.40, 7.0.0 - 7.0.33, 7.1.0 - 7.1.33, 7.2.0 - 7.2.33, 7.3.0 - 7.3.33, 7.4.0 - 7.4.33, 8.0.0 - 8.0.30, 8.1.0 - 8.1.28, 8.2.0 - 8.2.18, 8.3.0 - 8.3.6
- B,A
preferences:
248.12 ms | 404 KiB | 330 Q