Exam 2 Covers lists both linked and array in detail and simple tree ideas through binary search trees. It does not have any coding component.
There is a practice exam on PrairieLearn.
Exam 2 is 50 minutes long and only has multiple choice and short answer questions.
insertAtFront
, including running time and insertion strategiesinsertAtIndex
, including running time, on both a sorted and unsorted listremoveAtIndex
, including running time, on both a sorted and unsorted listinsertAfterElement
, including running time, on both a sorted and unsorted listremoveAfterElement
, including running time, on both a sorted and unsorted listfindIndex
, including running time, on both a sorted and unsorted listfindData
, including running time, on both a sorted and unsorted listNULL
pointers in a BST, including prooffind
, including running times in terms of h
and n
insert
, including running times in terms of h
and n
delete
, including running times in terms of h
and n
h
, and propertiesb
Assignments referenced:
Points:60
Start: Sunday, September 25
End: Tuesday, September 27