Lectures related to Random binary tree

Encoder and Decoder for Prefix-Free Codes

Covers the implementation and verification of encoder and decoder for prefix-free codes, including classes and types, lemmas on trees, and the main theorem.

Fast Interval Queries

Focuses on designing a data structure for fast interval queries on a complete binary tree.

Dynamic Data Structures: Vectors and Linked Lists

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

Memory Design: Column Multiplexers

Delves into memory design, specifically column multiplexers and DRAM cell structures.

Binary Search Algorithm

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

Binary Search Trees: Operations and Implementations

Explores Binary Search Trees, covering operations like searching, finding min/max, successors, and printing.