Implement recursive binary search in Python

[Mike323334]

This implementation includes a docstring with usage examples for the binary search function.

Describe your change:

This pull request adds a recursive implementation of binary search.
While the repository already contains iterative binary search variants, a recursive version was missing.
This addition improves conceptual completeness and aligns with existing recursive search and traversal algorithms already present in the repository.

The implementation includes type hints, doctests, and usage examples in the docstring, following existing project conventions.

• [x ] Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• Documentation change?

Checklist:

• [ x] I have read CONTRIBUTING.md.
• [ x] This pull request is all my own work -- I have not plagiarized.
• [x ] I know that pull requests will not be merged if they fail the automated tests.
• [x ] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [x ] All new Python files are placed inside an existing directory.
• [x ] All filenames are in all lowercase characters with no spaces or dashes.
• [ x] All functions and variable names follow Python naming conventions.
• [ x] All function parameters and return values are annotated with Python type hints.
• [ x] All functions have doctests that pass the automated testing.
• [x ] All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".