CKTIS / PHP
Recursion and base cases
A recursive call needs a base case and progress toward it.
Version: PHP 8.4; repository runtime, production runtime not attested
Syntax
function leaves(array $node): int { /* descend until leaf */ }A recursive call needs a base case and progress toward it. In a nested array, handle a scalar leaf directly and recurse only into child arrays. An empty child contributes no leaves. This assumes an acyclic tree. Very deep nesting consumes call stack space and may require an explicit stack.
function leaves(array $node):int {$n=0;foreach($node as $v){$n+=is_array($v)?leaves($v):1;}return $n;}
echo json_encode([leaves([1,[2,[],[3]],4]),leaves([])]);
[4,0]
Examples
<?php
function leaves(array $node):int {$n=0;foreach($node as $v){$n+=is_array($v)?leaves($v):1;}return $n;}
echo json_encode([leaves([1,[2,[],[3]],4]),leaves([])]);
Result
[4,0]