Imagine a small record lookup tool: each record has a distinct numeric ID, and a user asks for the record with a given ID. A BST can organise those IDs so that a comparison tells us which side might contain the target.

Before coding, write the input, required output, duplicate policy and failure behaviour. Explain why the structure fits the task and what happens if insertion order creates a tall chain.

Optional design and documentation checklist

Describe a real task, explain each function's parameters and return value, test a missing key, and justify any use of references versus copies. Record the algorithm's assumptions and cite sources for borrowed ideas. A clear report should let someone else reproduce and assess your work. Check any actual course assignment against current instructions supplied by your professor.