Computer Science 210
Data Structures

Fall 2017, Siena College

Home     Syllabus     Schedule     Examples     Style Guide

Agenda

• Announcements
  • wow, it's December
  • Exams not fully graded, but for those who are concerned that today is the last withdrawl day, come by and we'll see where you stand so far. Lab practical portion grades are in GitHub.
• Lecture 30 assignment recap and AVL tree wrapup
• Programming Project 5: Best Of discussion
• Array representation of trees
• Priority queues
  • Vector-based implementation
• Heaps

Lecture 31 Assignment

Due at the start of class, Monday, December 4.

Please submit answers to these questions in Blackboard under "Lecture 31 Assignment" by the start of class. We will discuss these questions at the start of class, so no late submissions can be accepted.

1. Bailey Problem 13.2, p. 338 (4 points)
2. Bailey Problem 13.4, p. 338 (3 points)
3. Bailey Problem 13.6, p. 338 (3 points)

Terminology

• balanced
• priority queue
• heap
• min-heap
• max-heap