Lectures related to Binary tree

Covers operations and procedures related to binary search trees, including finding successors and predecessors.

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

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

Explains compression and Kraft inequality in codes and sequences.

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

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

Covers operations and implementations of binary search trees.

Explores disk storage anatomy, access times, buffer management, and tree-structured indexing techniques like B+ Trees.