Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Binary Search Trees: Operations and Implementations
Graph Chatbot
Related lectures (26)
Previous
Page 2 of 3
Next
Optimal Binary Search Trees
Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.
Optimal Binary Search Trees
Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.
Algorithms: Final Exam Review
Provides a detailed review of the 2016 final exam, covering various algorithmic problems.
Fast Interval Queries
Focuses on designing a data structure for fast interval queries on a complete binary tree.
Huffman's Algorithm: Mechanizing the Proof
Explores the mechanization of Huffman's algorithm proof and functional implementation.
Algorithmic Paradigms for Dynamic Graph Problems
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.
Binary Search: Basics and Execution
Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.
Dynamic Programming: Palindromic Subsequences
Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.
Binary trees and Catalan numbers
Covers the definition of binary trees, recursive formulas, and generating functions for Catalan numbers.
