Announcements

• Ants
  • Phase 1: Friday!
  • Phase 2: Tuesday (next week)
  • Due Date: next Friday

Notes from last section

• hi
  • hi!
• do you play any rhythm games
  • not very often, but have played some
    • rhythm heaven/rhythm doctor
    • crypt of the necrodancer
• Do you play League of Legends
  • nope!
• OOP review
  • to an extent we'll get something today!

Notes from last section

• Multiple inheritance
  • won't need to worry too much about this
  • it is in scope, but you generally don't need to know too much about it other than the fact that you can inherit methods from different parents
• i think the mini lectures could have been a bit slower and we could have spent less time on the second problem.
  • honestly i agree yeah oops

Notes from last section

• where were you on monday?
  • at a cubing competition
  • i went to vancouver the past weekend for canadian championships
  • i got pretty good results (load a video i guess)
• In the Game Pokemon Mystery Dungeon, the is a useful item known as the Pass Scarf, which, at the expense of 2 hunger per pass, can pass off any physical attack. It tends to pass off to the physical attack to the lower right, so proper positioning of your partner Pokemon can lead to strategies built of reflecting damage. There is also a surprising variety of moves that can be passed off, though no thrown items are susceptible to this ability
  • meta moves in pmd are very different to regular pokemon

Temperature Check

• Mutable Trees
• Linked lists (Covered in today's lecture)

Trees (construction)

• The Tree constructor takes in a label, and an optional list of branches. If branches isn't given, it defaults to an empty list []

Construction: Tree(2); Tree(2, [Tree(3), Tree(4)])

Note that the branches must be in a list.

Linked Lists

• Linked lists are recursive data structures
• You can use linked lists to create your own version of a sequence
• They are generally useful when you want to have an infinitely-sized list, or want to dynamically change the size of the list (more useful in 61B if you do end up taking it)
• In general, linked lists problems can be solved using both iteration and recursion
  • Like trees, they are recursive data structures, but unlike trees, you can use both recursion and iteration to solve them.

Linked Lists (Anatomy)

• Linked lists have a first (similar to label) attribute and a rest (similar-ish to branches) attribute.

Mental Health Resources

• CAPS:
  • If you need to talk to a professional, please call CAPS at 510-642-9494.
• After Hours Assistance
  • For any assistance after hours, details on what to do can be found at this link