Lecture 22 | Programming Abstractions (Stanford)

Lecture 22 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

Julie discusses map as a vector and describes a different, possibly better, strategy. The basics of trees and their usefulness and how they can be used with binary search is then introduced.

Complete Playlist for the Course:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69

CS 106B Course Website:
http://cs106b.stanford.edu

Stanford Center for Professional Development:
http://scpd.stanford.edu/

Stanford University:
http://www.stanford.edu/

Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• 22
• map
• vector
• strategy
• trees

[agapitoflores001]

Yeah, I bet this is. I definitely agree.

[dimipeli]

This maybe the most important lecture in the series.

[ghosnah]

Thank you!  Great work, Julie