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.

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

the class that provides AVL tree delete method has been added #40

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

the class that provides AVL tree delete method has been added #40

wants to merge 2 commits into from

Conversation

bakhodir10
Copy link

No description provided.

return node == null ? -1 : node.height;
}

private int max(int a, int b) {
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why didn't you use Math.max() instead of creating this method

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Yes, I should have used Math.max() method. it would be less code ))

Copy link
Owner

@sherxon sherxon Feb 2, 2018

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@bakhodirsbox Did you test all cases? if it is passing i will merge and close this

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@sherxon It looked correct after then I have found some errors, let me fix it. I think I can pull request after making sure it works correctly for every test

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants