Skip to content

Conversation

PauLopNun
Copy link
Contributor

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

- Implements Binary Tree Sort using BST with inorder traversal
- O(n log n) average case, O(n²) worst case time complexity
- Includes comprehensive test suite extending SortingAlgorithmTest
@codecov-commenter
Copy link

codecov-commenter commented Oct 6, 2025

Codecov Report

❌ Patch coverage is 96.29630% with 1 line in your changes missing coverage. Please review.
✅ Project coverage is 76.62%. Comparing base (69d8406) to head (d562aba).

Files with missing lines Patch % Lines
...n/java/com/thealgorithms/sorts/BinaryTreeSort.java 96.29% 0 Missing and 1 partial ⚠️
Additional details and impacted files
@@             Coverage Diff              @@
##             master    #6666      +/-   ##
============================================
+ Coverage     76.60%   76.62%   +0.02%     
- Complexity     6026     6035       +9     
============================================
  Files           719      720       +1     
  Lines         20326    20353      +27     
  Branches       3937     3940       +3     
============================================
+ Hits          15571    15596      +25     
  Misses         4164     4164              
- Partials        591      593       +2     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:
  • ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

@DenizAltunkapan
Copy link
Member

This implementation correctly performs a Binary Search Tree–based sort, but it duplicates the existing TreeSort algorithm.

Both build a Binary Search Tree and use an inorder traversal to produce a sorted output.
Since the functionality already exists in the repository, this PR does not introduce a new sorting algorithm and therefore should be closed.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants