CSC190H1 Lecture Notes - Lecture 9: Binary Search Tree, Binary Tree, Binary Search Algorithm
Document Summary
structure of what we"ve learned thus far: Before proceeding it"s worth reviewing what we"ve done so far, to ensure the order of what we"re doing is clear in your head. Our starting point was the list: a versatile data structure that is offered by python natively, and was the first major thing we did with c. We then indicated that we can derive two structures from the list: * queues and we discussed how these specializations of lists are useful (i. e. , despite their restrictions --- or rather *because* of their restrictions --- they find application in the solution of various kinds of problems). So, topic-wise: lists -> { stacks, queues } Thus far, we"re talking about linear data structures: that is data structures that have a single dimension of sequential ordering. We then expanded our toolkit by considering trees. These are data structures that can be constructed via:
