Leaves - Bri #43
Open
Leaves - Bri #43
Conversation
This file contains 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
CheezItMan
reviewed
Feb 23, 2020
| @@ -19,48 +19,105 @@ def initialize | |||
| # method to add a new node with the specific data value in the linked list | |||
| # insert the new node at the beginning of the linked list | |||
| def add_first(value) | |||
| previous = @head | ||
| current = @head | ||
|
|
||
| until current.nil? |
There was a problem hiding this comment.
I'd suggest going until current.next.nil?, and then setting current.next equal to a new node.
| return nil | ||
| else | ||
| return @head.data | ||
| end | ||
| end | ||
|
|
||
| # method that inserts a given value as a new last node in the linked list | ||
| def add_last(value) |
| end | ||
|
|
||
| previous = @head | ||
| current = @head |
There was a problem hiding this comment.
You should also put in a check to make sure that the node we're deleting is not the head.
| end | ||
| # end | ||
|
|
||
| # method to print all the values in the linked list | ||
| def visit |
| count += 1 | ||
| current = current.next | ||
| end | ||
| return count | ||
| end | ||
|
|
||
| # method that returns the value at a given index in the linked list | ||
| # index count starts at 0 | ||
| # returns nil if there are fewer nodes in the linked list than the index value | ||
| def get_at_index(index) |
| end | ||
| current = current.next | ||
| end | ||
| return min | ||
| end | ||
|
|
||
|
|
||
| # method that returns the length of the singly linked list | ||
| def length |
| end | ||
| current = current.next | ||
| end | ||
| return max | ||
| end | ||
|
|
||
| # method to return the min value in the linked list | ||
| # returns the data value and not the node | ||
| def find_min |
| temp = temp.next | ||
| end | ||
| return false | ||
| end | ||
|
|
||
| # method to return the max value in the linked list | ||
| # returns the data value and not the node | ||
| def find_max |
| @@ -19,48 +19,105 @@ def initialize | |||
| # method to add a new node with the specific data value in the linked list | |||
| # insert the new node at the beginning of the linked list | |||
| def add_first(value) | |||
| raise NotImplementedError | |||
| current_node = Node.new(value, @head) | |||
| @head = current_node | |||
| end | |||
|
|
|||
| # method to find if the linked list contains a node with specified value | |||
| # returns true if found, false otherwise | |||
| def search(value) | |||
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.