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

Leaves - Bri #27

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

Leaves - Bri #27

wants to merge 4 commits into from

Conversation

brilatimer
Copy link

Linked List Comprehension Questions

Question Response
1. What advantages does a LinkedList have over an Array? A LinkedList allows for an insert for O(1) cost, vs an Array requires O(n) cost to move all values over.
2. When is an Array more advantageous? Arrays have a lower cost/faster to look up nth value vs LinkedLists have to iterate through all values.
3. When is an Array more advantageous? ---

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.

You definitely have a feel for linked lists, but you have a few bugs here. Take a look at my comments and let me know if you have questions.

def add_first(data)

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

Choose a reason for hiding this comment

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

Suggested change
node = Node.new(data, nextNode = @head)
node = Node.new(data, @head)

# Space complexity - ?

# 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.

👍

# Space complexity - ?

# 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.

👍

# Space complexity - ?

# Time complexity - O(n)
# Space complexity - O(1)
def length

Choose a reason for hiding this comment

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

👍

# Space complexity - ?

# Time complexity - O(n)
# 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_last(data)

node = Node.new(data, nextNode = nil)
if @head == nil

Choose a reason for hiding this comment

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

🥇

def get_last

last_node = @head

Choose a reason for hiding this comment

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

What if head is nil?

Suggested change
last_node = @head
return nil if head.nil?
last_node = head

# Space complexity - ?

# Time complexity - O(n)
# Space complexity - O(1)
def get_at_index(index)

Choose a reason for hiding this comment

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

What if index is greater than the length of the list?

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