Your Turn!
Now it's your turn!
We're going to try crowdsourcing some end-of-semester information about data structures.
-
You have a couple of options. Please take around 15 minutes to read up on (or think about!) one or more of these data structures, and add a comment describing what you read (or came up with).
-
Check back as the week goes on to see what other people have found!
-
There are pages linked below for a bunch of different data structures. Some we've studied in class, but others are things we haven't gotten to but that we think are cool.
-
You can choose one you feel really comfortable with, one you'd like to learn more about before the end of the semester, or one you've never even heard of before—it's entirely up to you!
-
Think of it as a CS 70 Choose Your Own Adventure!
Data Structures We've Seen in CS 70
Each of the buttons below takes you to an EtherPad page where you can add your thoughts about a data structure we've covered. You can also read what other people have written. If you have comments about the page, there's even a “chat” feature.
- Randomized BSTs
- Random BSTs
- 2–3–4 Trees
- Red–Black Trees
- Hash Tables
- Linked Lists
- Array-Backed Lists
- Min/Max Heaps
- Splay Trees
Data Structures We Haven't Seen in CS 70
If the above list seems too tame, here are some more data structures that we haven't seen in CS 70. You'll need to do a bit of sleuthing to find out more about them, but that's part of the fun!
- B Trees
- AVL Trees
- Weight-Balanced Trees
- Scapegoat Trees
- Treaps
- Skip Lists
- Suffix Trees
- Bloom Filters
- Tries
- Disjoint Sets
(When logged in, completion status appears here.)