Conceptual overview of Binary Search Trees
Channel:
Subscribers:
2,650
Published on ● Video Link: https://www.youtube.com/watch?v=v3C8YsOR-SQ
0A Binary Search Tree (BST for short) is a data structure in which everyone to the left of the current node has a smaller value, and everyone to the right has a larger value. If they can be guaranteed to be balanced (which is junior level data structures), then they have O(logN) insert, search, and delete operations, and never need to be sorted, since they're always sorted.
Other Videos By Bill Kerney
| 2024-04-01 | Memory Allocation Review and Pointer Tricks |
| 2024-04-01 | Big O Review |
| 2024-04-01 | C++: The Nameless (Classes, Lamdas, Variables) |
| 2024-03-18 | College Path Lecture (Class Offerings and Transfer Possibilities) |
| 2024-03-18 | Recursion |
| 2024-03-15 | RPG-41 Overview |
| 2024-03-15 | UNIX / Vim Quiz #2 |
| 2024-03-11 | Black Box BST Debugging / BST Delete Algorithm |
| 2024-03-08 | Quiz Time: UNIX and Vim |
| 2024-03-06 | C++: BST print, insert, and invariants |
| 2024-03-04 | Conceptual overview of Binary Search Trees |
| 2024-03-04 | C++: Templated Stacks and Queues |
| 2024-03-02 | Queues and Stacks |
| 2024-03-02 | C++: Debugging Linker Errors |
| 2024-02-28 | C++: Dynamic Cast |
| 2024-02-28 | CSCI 1: Fallacies and Midterm I Review |
| 2024-02-26 | C++ Circular Lists, Sentinel Nodes, Merging Lists |
| 2024-02-26 | C++: Keywords You Might Not Know |
| 2024-02-23 | C++ Inheritance |
| 2024-02-21 | C++ Smart Pointers |
| 2024-02-14 | C++: Inserting into a Linked List |