Skip to content

Glossary: Coding Interviews in Java

Base case

Also written: base answer

The simplest input of a recursive method, answered directly without recursing, such as an empty tree adding 0 or `i == items.length` in backtracking. Without it, recursion never stops.

Where the book teaches it

Related terms

Tree recursionBacktrackingCall stack