Focuses on designing a data structure for fast interval queries on a complete binary tree.
Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.
Introduces parallel scan left in Scala, covering its properties, sequential solutions, and efficient parallel computation techniques.
Explores optimal binary search trees to minimize search cost using dynamic programming and recursive formulations.
Explores counting labeled trees using Prüfer codes and algorithms, providing maps between trees and sequences.
