Computer Science 385
Design and Analysis of Algorithms

Spring 2026, Siena University

Home     Syllabus     Schedule

Agenda

• Announcements
  • Academic Showcase Project: group formation needs to be done today (anyone not in a group will be placed in one) and topic selection should be well underway
  • Lab 6: Divide and Conquer and More Traversals, get remaining checkpoints done before your lab meeting tomorrow
  • Don't forget to submit a link to your completed copy of the shared document for last week's In-class Lab Activity on the Divide and Conquer Closest Pair algorithm to claim your 20 lab points
  • Problem Set 4: [PDF] is underway, due Friday, see the video intro if you haven't yet
  • Empirical Study 2: [PDF] is also underway, no deadlines until after Easter break
• Exam 2 information
• About the FINDMAX algorithm from Lab 6: Divide and Conquer and More Traversals Question 3
• Balanced trees
  • AVL trees
  • 2-3 trees

Terminology

• balanced trees
• balance condition
• red-black trees
• AVL trees
• splay trees
• 2-3 trees
• 2-nodes, 3-nodes, and (temporary) 4-nodes
• perfectly balanced

Links

• AVL Trees at Visualgo