Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Binary Search Trees Operations
Graph Chatbot
Related lectures (33)
Binary Search Trees: Operations and Implementations
Covers operations and implementations of binary search trees.
Algorithms Exam Preparation
Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost efficiently.
Binary Search Algorithm
Explains the binary search algorithm using two pointers to efficiently search a sorted list.
Recursion and Binary Search
Introduces recursion and binary search algorithms for efficient problem-solving.
Dynamic Programming: Palindromic Subsequences
Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.
Recursive Algorithms: Induction and Recursion
Introduces recursive algorithms for factorial, exponentiation, and search.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.
Tree-Structured Indexing: B+ Trees Explained
Log in to Mediaspace to watch this video
Covers B+ Trees, a key data structure for efficient indexing in databases.
Binary Search Trees: Operations and Procedures
Log in to Mediaspace to watch this video
Covers operations and procedures related to binary search trees, including finding successors and predecessors.
Binary Search Trees: Implementation and Operations
Log in to Mediaspace to watch this video
Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.
Binary Search Trees: Operations and Implementations
Log in to Mediaspace to watch this video
Explores Binary Search Trees, covering operations like searching, finding min/max, successors, and printing.
Longest Common Subsequence and Optimal BST
Log in to Mediaspace to watch this video
Explores Longest Common Subsequence and Optimal Binary Search Trees, discussing algorithms and probabilities for efficient search structures.
Algorithms: Final Exam Review
Log in to Mediaspace to watch this video
Provides a detailed review of the 2016 final exam, covering various algorithmic problems.
Optimal Binary Search Trees
Log in to Mediaspace to watch this video
Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.
Optimal Binary Search Trees
Log in to Mediaspace to watch this video
Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.
Binary Search: Logarithm Function
Log in to Mediaspace to watch this video
Explains binary search, the logarithm function, and recursive algorithms for factorial and Fibonacci sequences.
Algorithmic Paradigms for Dynamic Graph Problems
Log in to Mediaspace to watch this video
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Huffman's Algorithm: Mechanizing the Proof
Log in to Mediaspace to watch this video
Explores the mechanization of Huffman's algorithm proof and functional implementation.
Previous
Page 1 of 2
Next
