Base case
Also written: base answer
The simplest input of a recursive function, answered directly without recursing, such as an empty tree (`None`) or `i == len(items)`. Without it, recursion never stops.
Also written: base answer
The simplest input of a recursive function, answered directly without recursing, such as an empty tree (`None`) or `i == len(items)`. Without it, recursion never stops.