82%
PassedA strong result. Consider moving on to more challenging material for the concepts covered here.
Solid work on analysis. Revisit the constant-time operations on linked lists — deletion of a known node also qualifies.
— Dr. Emeka Nwosu
What is the worst-case time complexity of searching for a value in an unsorted array of n elements?
O(1)
O(log n)
Correct: O(n)
O(n log n)
Binary search can be applied directly to an unsorted array.
True
Correct: False
Which of the following operations are constant time on a doubly linked list, given a reference to the node involved?
Correct: Insert a new node after the given node
Correct: Delete the given node
Access the element at position n/2
Correct: Read the value stored in the given node
State the precondition that binary search requires of its input, in one sentence.
A different explanation of "Recursion"
Four questions on recursion were answered incorrectly in a row during the last practice set.
Reread with the alternative explanationReview "Recursion" before starting "Trees"
"Trees and binary search trees" builds on recursion, which is currently at 34% mastery.
Open the recursion lessonExtra practice on "Linked structures"
Mastery is 58%, just below the 70% threshold; short practice sets raise it fastest at this stage.
Start practice set