CSci 227 Syllabus    Resources    Coursework

Laboratory Exercise 12
CSci 227: Programming Methods
Department of Computer Science
Hunter College, City University of New York
Spring 2024

---

Learning Objectives:

• To understand basic operations on binary search trees and their worst case running times.
• To learn what a graph is and how it is used.
• To implement the graph abstract data type using multiple internal representations.

Software Tools Needed: Web browser to access textbook and an IDE (on-line or on computer) with core Python 3.6+ loaded.

---

Binary Search Trees

In lecture, we introduced binary search trees. Work through Sections 6.12-6.15 of the textbook:

Graphs

In lecture, we introduced graphs. Work through Sections 7.1-7.5 of the textbook:

Quizzes and Code Reviews

There are weekly written quizzes and code reviews in 1001G, 11:30-5:30, Mondays-Fridays when classes are in session. No appointments are needed for CSCI 227 students. Make sure to complete Quiz 12 and Code Review 12 by Thursday, 9 May.

Additional Practice

For additional practice on core Python, see the HackerRank prepare series:

HackerRank: Prepare Python

Click the Easy option on the right hand menu, and work through their Python challenges.

For more practice on using dictionaries to solve problems, here are some popular ones from LeetCode where using dictionaries is an efficient approach:

• LC 701 (Insert Into a Binary Search Tree)
• LC 700 (Search in a Binary Search Tree)
• LC 997 (Find the Town Judge)