Week 11 Day 3 - BSTs and Hash Tables

Channel:

Bill Kerney

Subscribers:

2,650

Published on March 27, 2021 1:48:31 AM ● Video Link: https://www.youtube.com/watch?v=3ANjhK9NnaM

Duration: 1:20:58

193 views

1

Today we talked a bit about the implementation of BST search and some interesting ways it could be improved. Then we talked about Hash Tables, and gave two different implementations for it: linear probing, and with chaining.


Hash Tables have the very interesting property of being able to throw more RAM at a problem to go faster, which makes them useful in a lot of contexts. They're not too difficult to implement, and in fact I implemented a reasonably fast (though there's much faster implementations still) implementation of a hash table with chaining in a few lines of code.


No homework over Spring Break over zyBooks, and there's two opportunities to make up missing points. Watch the video to find out the details!