Sourav Hota — R45-T028: Cover the failure behavior of printTree (RedBlackBST.java) [src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java] #28

Student: Sourav Hota

Task: R45-T028 · 8 of 10
Repository: https://github.com/S-AI-Projects/TheAlgorithms-Java
Assigned working branch: student/e26b07f0855

Goal

Work on src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java. Exercise a documented failure or absent-result branch of printTree. Where the contract is total, use its valid empty/missing-result case instead of inventing an exception. Fixture: Build a tree with keys 4, 2, 6, 1, 3, 5 and 7; exercise the named operation at the root and at a leaf. Use the existing node type.

Steps

1. Read src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java, especially printTree near line 29. Record its public inputs, result, mutation behavior and any external dependencies before changing it.
2. Locate the actual return, raise, rejection or fallback branch in the source and construct the smallest input reaching it.
3. Assert the intended exception/sentinel and verify that caller-owned state remains valid afterwards; include a successful call after the failure.
4. Implement work/R45-T028/check.py as a focused runner that executes the new checks and propagates failures. Native check to incorporate: mvn test (JDK 21 as specified in pom.xml); use JUnit in the corresponding src/test/java package. Record the actual command and nonzero test count.
5. Create the checks specified below and run python3 work/R45-T028/check.py. Save inputs, expected versus actual results and tool versions in work/R45-T028/; a check must exit non-zero when an assertion fails.
6. Commit the repository change on branch R45-T028; prepare a PR to the organisation fork explaining the result and linking the checks. Keep each task independently reviewable. Remove work/R45-T028/ from a later upstream branch.

Done when

☐ The checked behavior is tied to printTree in src/main/java/com/thealgorithms/datastructures/trees/RedBlackBST.java; every assertion has an explicit expected value.
☐ Build a tree with keys 4, 2, 6, 1, 3, 5 and 7; exercise the named operation at the root and at a leaf. Use the existing node type.
☐ Existing supported behavior and the public interface are preserved unless a failing regression demonstrates and documents a defect.
☐ The tested branch is named by source line and the input actually reaches it.
☐ An ordinary valid call still succeeds after the failure case.

Submission checklist

• Complete this task and its checks.
• Add the required evidence and link your pull request here.
• Select this S-AI-Projects fork as the PR base repository.
• Request instructor review.

Keep this PR focused on this task. Do not submit assignment PRs to the upstream repository.