Concept

Random binary tree

Related lectures (26)

Binary Search Trees: Operations and Implementations

Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.

Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.

Data Structures: Stacks, Queues, Linked Lists

Covers stacks, queues, linked lists, and binary search trees in data structures.

Class Hierarchies

Covers abstract classes, class extensions, object definitions, companion objects, and dynamic binding in Scala.

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: Basics and Execution MOOC: Information, Computation, Communication: Introduction to computational thinking

Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.

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.

Recursive Algorithms: Induction and Recursion

Introduces recursive algorithms for factorial, exponentiation, and search.

Data Compression: Source Coding

Covers data compression techniques, including source coding and unique decodability concepts.

Dynamic Data Structures: Vectors and Linked Lists

Covers the comparison between vectors and linked lists in C++ programming.

Binary Search Algorithm

Explores the binary search algorithm's efficiency in reducing search time.

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

Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.

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

Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.

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.

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.