Skip to content

Glossary: Coding Interviews in Rust

Base case

Also written: base answer

The simplest input of a recursive function, answered directly without recursing, such as an empty tree or `i == items.len()`. Without it, the recursion never stops.

Where the book teaches it

Related terms

Tree recursionBacktracking