Fixes issue #2603: Implementation of Tree Sort and Generic Type BST #2638
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Describe your change:
This PR makes the following contributions:
Adds a new algorithm Tree Sort under /Sorts (as assigned via this issue)
Adds a generic type implementation of BST under /DataStructures/Trees. The existing BST implementations used primitive type
int
, however,SortAlgorithm
interface requires sorting for any type that extends theComparable
interface. Therefore, generic type implementation of BST was required to facilitate Tree Sort.Adds proper package names to /DataStructures/Trees/BSTIterative and /DataStructures/Trees/BSTRecursive classes.
modify the class being used in
main()
function of /DataStructures/Trees/BSTRecursive fromBSTIterative
toBSTRecursive
. Before this change,BSTRecursive
was testingBSTIterative
in itsmain()
method which was clearly not correct.Add an algorithm?
Fix a bug or typo in an existing algorithm?
Documentation change?
References
Issue #2603.
Checklist:
Fixes: #{$ISSUE_NO}
.