There will be one programing question. The programing question will be in an enviroment identical to the PotDs. It will require programming complete and correct C++ programs. Partial credit will only be given for working, compilable code that passes some test cases. Code that doesnt compile will not receive any credit. Multiple (but not unlimited) submissions will be allowed. The programing questions will be working on some recursive function on a binary tree.
There will also be several short answer or multiple choice questions on material covered on previous exams as well as the trees topics listed below.
NULL
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
find
, 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
Assignments referenced:
Points:60
Registration: Thursday, March 02
Start: Monday, March 20
End: Wednesday, March 22