CSC 207.02 2019S, Class 31: Binary search trees II

Overview

Preliminaries

Smile, you’re on (not so) candid camera!
Today we continue our exploration of binary search trees, focusing primarily on how we remove elements.
- Continue partners from Wednesday.
New policy If your code is not formatted according to Google style guidelines, neither the mentor nor I will help you.
Do not use ArrayLists to implement queues. That turns dequeue into an O(n) algorithm. I’ve provied a simple queue implementation that should suffice.
With yesterday’s illness, I’m a little behind (and a little discombobulated). Sorry.

Reading for Monday: chapter 12 of Osera
Assignment 8 due Thursday the 25th
- Your partner is your partner from today’s lab.
- If you worked alone, find a partner.
Lab writeup for today: TBD

30 Minutes of Mindfulness at SHACS/SHAW every Monday 4:15-4:45
Any organized exercise. (See previous eboards for a list.)
60 minutes of some solitary self-care activities that are unrelated to academics or work. Your email reflection must explain how the activity contributed to your wellness.
60 minutes of some shared self-care activity with friends. Your email reflection must explain how the activity contributed to your wellness.

Participate in Kinetic Sculpture Competition: Saturday the 27th
- https://bit.ly/kineticsculpture19
- You’ll need to build your sculpture in advance
- You get reimbursed for up to $200 in supplies, but must present to be reimbursed.
Public speaking workshop - April 22 at 7pm in HSSC S3325, with Kathy Clemons-Beasley ‘05.