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

completed #35

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

completed #35

wants to merge 3 commits into from

Conversation

iris-lux
Copy link

Linked List Comprehension Questions

Question Response
1. What advantages does a LinkedList have over an Array? Removing from the front is o(1)
2. When is an Array more advantageous? When you want to be able to quickly access the middle of the list
3. What questions do you have about linked lists? What are some real-world applications of linked lists?

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

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

Well done Iris, you hit the learning goals here. Nice work.

Comment on lines +12 to +13
@last = nil
@length = 0

Choose a reason for hiding this comment

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

Nice instance variables

Comment on lines +16 to 18
# Time complexity - O(1)
# Space complexity - O(1)
def add_first(data)

Choose a reason for hiding this comment

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

👍

Comment on lines +23 to 25
# Time complexity - O(1)
# Space complexity - O(1)
def get_first

Choose a reason for hiding this comment

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

👍

Comment on lines +31 to 33
# Time complexity - O(1)
# Space complexity - O(1)
def add_last(data)

Choose a reason for hiding this comment

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

👍

def add_first(data)

@head = Node.new(data, @head)

Choose a reason for hiding this comment

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

Suggested change
@head = Node.new(data, @head)
@head = Node.new(data, @head)
@last = @head if @last.nil?

Comment on lines +44 to 46
# Time complexity - O(1)
# Space complexity - O(1)
def get_last

Choose a reason for hiding this comment

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

👍

Comment on lines +51 to +53
# Time complexity - O(n)
# Space complexity - O(n)
def get_at_index(index, node = @head)

Choose a reason for hiding this comment

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

👍 Nice recursive solution

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

Successfully merging this pull request may close these issues.

2 participants