Class 29: The Forrest and the Trees

cs1120: Introduction to Computing
Explorations in Language, Logic, and Machine
University of Virginia, Spring 2016

http://xplorecs.org/class29

Class 29:
Transitivity
Subclassing Tree
Implementing OrderedBinaryTree

Transcript

1. Class 29: The Forrest and the Trees Introduction to Computing: Explorations in Language, Logic, and Machines cs1120 Spring 2016 David Evans University of Virginia
2. Recap • With unstructured data: general search problem has running time in Ω(N) where N is the number of elements • By organizing data into a balanced tree with an ordering invariant, we can solve general search with running time in (log N) • Logarithms grow very slowly: log2 Billion < 30
3. Implementing Ordered Binary Trees
4. Tree A Tree is a: a value (any object), and a list of Tree objects (its children)
7. What is a binary tree?
9. How should we make an ordered binary tree?
13. height
19. Charge Project 5: target deadline is Monday – Don’t be overly stressed about this: real deadline is to qualify for Red Belt test (complete Project 6) by April 29. If you are stuck, not making progress, or unsure what you should be doing, make sure to check in with me today or at office hours tomorrow.