Open
Conversation
CheezItMan
reviewed
Oct 18, 2019
CheezItMan
left a comment
CheezItMan
left a comment
There was a problem hiding this comment.
Thanks for the PR. Sorry I didn't notice it till now. The methods you have here look really good. Nice work!
| # insert the new node at the beginning of the linked list | ||
| # Time Complexity: O(1), no need to traverse | ||
| # Space Complexity: O(1) | ||
| def add_first(value) |
| # returns true if found, false otherwise | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity: O(1) | ||
| def search(value) |
| # returns the data value and not the node | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity O(1) | ||
| def find_max |
| # returns the data value and not the node | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity: O(1) | ||
| def find_min |
| # method that returns the length of the singly linked list | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity: O(1) | ||
| def length |
| # returns nil if there are fewer nodes in the linked list than the index value | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity: O(1) | ||
| def get_at_index(index) |
| # method to print all the values in the linked list | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity: O(1) | ||
| def visit |
| # method to delete the first node found with specified value | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity O(1) | ||
| def delete(value) |
| # note: the nodes should be moved and not just the values in the nodes | ||
| # Time Complexity: O(n), we may need to traverse all nodes | ||
| # Space Complexity: O(1) | ||
| def reverse |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
No description provided.