COMPSCI 61A Study Guide - Midterm Guide: Linked List, Init

22 views1 pages
23 Jan 2018
School
Professor
zogo39484755 and 6 others unlocked
COMPSCI 61A Full Course Notes
22
COMPSCI 61A Full Course Notes
Verified Note
22 documents

Document Summary

Tree : def init ( self label , branches. Why ? values are pointers to objects . checks if the pointers o=t!= are the same as islis not this can be changed for a class. Pointing at the same tin r ex :# s lists strings , tuples , sets diets check contents. Adopt pattern cached ( previously ) memorized values. K ==l return tree an ) b= hailstone tree ( k - d ,2*m , hailstone tree kt. Sets container type set literals are enclosed in braces duplicate elements removed on construction. Membership like dictionary entries testing value an element. Union combine intersection what sin common more one theres. 2 : a set linked list ordered from least to greatest s= Same of as growth unordered have to search. O ( n ) go worst down case is when list.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions