Implementation lab in Binary Search Trees

Mission

Search a BST by choosing one subtree per comparison.

Learning outcome: Implement ordered search

Correctness contract

Invariant: Each left-subtree key is smaller and each right-subtree key is larger than its root.

Required technique: Compare at each node and recurse or iterate into only the one possible subtree.

Complexity target: time O(height); space O(height).

Input and output

Input: n, then n distinct BST keys in insertion order, then one target key. Whitespace may be spaces or line breaks.

Output: Print exactly true or false in lowercase. Return it as a String; Main.java prints it without adding other text.

Assumptions:

• Inserted BST keys are distinct.
• All values fit in signed 32-bit integers.

Before you code

1. Restate the input and output contract, then predict the visible example without running code.
2. Implement the core state transition: Compare at each node and recurse or iterate into only the one possible subtree.
3. Trace the smallest boundary case, verify exact formatting, and justify the authored time and auxiliary-space bounds.

Implement Practice.solve(Scanner sc). Keep every provided filename and public class name unchanged.

Sample input

5 8 4 12 2 6 6

Sample output

true

Why the sample works: Visible walkthrough for the ordinary non-trivial path. Each comparison retains only the one subtree whose key range may contain the target. Input `5 8 4 12 2 6 6` therefore produces `true`.

Progressive hints

Try the trace and first milestone before opening a hint. Open them in order.

Hint 1 — Contract: identify what each parsed variable represents and write the invariant beside the loop or recursive method.

Hint 2 — Next step: Trace the smallest non-trivial input and write the structure state after the operation before coding the loop.

Hint 3 — Verification: compare the structure state before and after one operation, then test the smallest valid input and a duplicate or unreachable case when allowed.