Brenna's Linked List

[bcmdarroch]

Linked Lists

Congratulations! You're submitting your assignment.

Comprehension Questions

What is the time and space complexity for each method you implemented? Provide justification.

Question	Answer
What is the time complexity of the insert method? Provide justification.	O(1) because I only change the head, no matter how long the list.
What is the space complexity of the insert method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the search method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the search method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the find_max method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the find_max method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the find_min method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the find_min method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the length method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the length method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the find_nth_from_beginning method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the find_nth_from_beginning method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the insert_ascending method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the insert_ascending method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the visit method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the visit method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the delete method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the delete method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the reverse method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the reverse method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the find_middle_value method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the find_middle_value method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the find_nth_from_end method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the find_nth_from_end method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.
What is the time complexity of the has_cycle method? Provide justification.	O(n) because loops through the linked list once with no nested loops.
What is the space complexity of the has_cycle method? Provide justification.	O(1) because the variables used do not depend on the size of the linked list.