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
Optimal Binary Search Trees
Graph Chatbot
Related lectures (28)
Algorithms Exam Preparation
Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost efficiently.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Dynamic Programming: Palindromic Subsequences
Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.
Data Structures: Stacks, Queues, Linked Lists
Covers stacks, queues, linked lists, and binary search trees in data structures.
Algorithm Analysis: Growth, Search, and Logarithm
Explores algorithm growth, search complexities, and logarithmic properties in depth, with practical exercises included.
Binary Search: Basics and Execution
MOOC: Information, Computation, Communication: Introduction to computational thinking
Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.
Binary Search Trees Operations
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.
Binary Search Trees: Operations and Implementations
Covers operations and implementations of binary search trees.
Recursion and Binary Search
Introduces recursion and binary search algorithms for efficient problem-solving.
Binary Search Algorithm
Explains the binary search algorithm using two pointers to efficiently search a sorted list.
Complexity & Induction: Algorithms & Proofs
Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
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.
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.
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.
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.
Algorithms in Computer Science: Search and Sort Techniques
Log in to Mediaspace to watch this video
Provides an overview of essential search and sort algorithms in computer science.
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.
Previous
Page 1 of 2
Next
