Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Binary search tree least common ancestor #25

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Binary search tree least common ancestor #25

wants to merge 2 commits into from

Conversation

shahdivyam
Copy link

Added algorithm to get least common ancestor of binary search tree .

@domfarolino
Copy link
Owner

@shahdivyam Thank you. Please check out the Google C++ Style Guide linked in the Contributing file in the root folder?

@shahdivyam
Copy link
Author

@domfarolino the formatting of the java code is consistent , as it is mentioned in contributing file

@domfarolino
Copy link
Owner

https://google.github.io/styleguide/javaguide.html#s4.1.2-blocks-k-r-style It is the brackets that are kinda throwing me off sorry

@shahdivyam
Copy link
Author

reformatting done , hope this would do fine :)

@domfarolino
Copy link
Owner

Thanks I should be able to merge this possibly tonight

@domfarolino
Copy link
Owner

Soo sorry I havent gotten to this yet! It is a priority I assure you! Thanks a lot for the PR

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@shahdivyam @domfarolino