added impl for algorithm and base objects for algorithm

[jhonDoe15]

Describe your change:

• Add an algorithm?
  closes add nearestRightKey algorithm #2573

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Java files are placed inside an existing directory.
• All filenames are in all uppercase characters with no spaces or dashes.
• All functions and variable names follow Java naming conventions.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[jhonDoe15]

any changes and reviews are welcomed 😊

[jhonDoe15]

I'd appreciate a code review

[siriak]

It's not a standard algorithm and I don't see where it can be used, so I don't think we should include it, thanks!

[jhonDoe15]

@siriak it is used to find the tree node successor, its helpful in avl trees or when you need to find the node with the next greater key in the tree

[siriak]

Then could you implement it with 'keys' and not points? Anything with a strict order would do. And please reuse the existing classes for trees and other

[jhonDoe15]

the node key is represented by the point and the x value for each point is used to find the node successor

[siriak]

Why do you need Point then? Just use Value instead of Point.X

[jhonDoe15]

ok then, I'll replace it with a simple integer

[jhonDoe15]

would you mind opening the PR so I can commit to it?

[jhonDoe15]

all fixed and updated with the master branch

[siriak]

Overall looks good, only some small changes needed

---

Sema Reaction: 👌 This code looks good