Binary Search Trees (BST) Part I
Channel:
Subscribers:
2,640
Published on ● Video Link: https://www.youtube.com/watch?v=2rYqvbr8u_g
0Today we showed a little bit of low level code (what the node class for a BST would look like) and then did a lot of high level conceptual stuff with how BSTs insert and search, along with a discussion of balanced vs. unbalanced, and the importance of understanding Big-O running times for all the common data structures.
Other Videos By Bill Kerney
| 2023-03-24 | Recursion with Binary Trees |
| 2023-03-24 | Python in 40 Minutes or Something |
| 2023-03-22 | Cognitive Distortions |
| 2023-03-20 | Making a BST using BRIDGES |
| 2023-03-20 | SigCSE Report |
| 2023-03-20 | Cognitive Biases |
| 2023-03-13 | Homework Assignment: Dungeon Delve |
| 2023-03-13 | Manufacturing Consent - News in the 80s vs Today |
| 2023-03-10 | Beautiful Computer Science - Fractals |
| 2023-03-10 | Fallacies Review |
| 2023-03-08 | Binary Search Trees (BST) Part I |
| 2023-03-08 | Little Review and Debugging Practice on Linked Lists and Templates |
| 2023-03-08 | Correlation is not Causation; Privacy vs. Google and Facebook |
| 2023-03-06 | Big-O Analysis |
| 2023-03-06 | Fallacies Part III (Non Seq, Strawman, Ad Hom, Tu Quoque, Ignorance) |
| 2023-03-03 | Corporate Censorship: The Lab Leak Hypothesis and The Twitter Files |
| 2023-03-03 | Trust Your Gut |
| 2023-03-01 | C++ Templates |
| 2023-03-01 | Encouraging Words: Computer Science is a Social Endeavor |
| 2023-03-01 | Set Theory |
| 2023-02-27 | C++ Stacks and Queues |