Week 18 Day 1 - EC, BST deletes, Graphs

Channel:
Subscribers:
2,700
Published on ● Video Link: https://www.youtube.com/watch?v=4Juq35eCnro



Duration: 1:33:49
83 views
0


We started off by talking about two extra credit assignments (learning Python and coming up with thumbnails/splash screens for my videos here), and went over the penultimate homework a bit.


I then gave an example of doing a delete from a BST, which isn't hard, there's just a lot of cases that have to be handled, which is lukewarm annoying.


Finally we began a discussion of graphs, which are (alongside vectors and hash tables) the most commonly made/used data structure for me. A graph is just a bunch of points (called vertices) connected by lines (called edges). There's a wide variety of graphs, I only showed the very simplest today, and how to store it in a simple 2D array, called an Adjacency Matrix.







Tags:
csci 41
bst
graph
c++