COMPSCI 61A Lecture 21: CS61A-Lecture 10-14-2016

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: De Nero John

Document Summary

Homework 8 is small, quick, worth only 1 point, and due tuesday 10/18. Focus on recursion, lists, mutation, recursive data, and objects. Review session sunday 10/16 12-3 in 155 dwinelle. Guerrilla section on saturday 10/15 12pm-3pm 247 cory on linked lists, oop, and binary trees. A binary tree is a tree that has a left branch and a right branch. Idea: fill the place of a missing left branch with an empty tree. Idea 2: an instance of btree always has exactly two branches. Using the binary tree implementation for the bonacci tree: A particular kind of binary tree that supports binary search. Binary search: a strategy for nding a value in a sorted list: check the middle and eliminate half. Relies on the idea that if a value is greater than a value at position i in a list, we don"t have to check all the positions below i again.