Media Summary: How to use the ideas of `map` and `fold` functionals with binary Structural induction can be used to prove the correctness of functions on BSTs can become unbalanced by insertions and deletions: what should we do then?
Balanced Trees Ocaml Programming Chapter - Detailed Analysis & Overview
How to use the ideas of `map` and `fold` functionals with binary Structural induction can be used to prove the correctness of functions on BSTs can become unbalanced by insertions and deletions: what should we do then? Asymptotic efficiency is important but can seem abstract. For concrete insight, it helps to compare the actual running time (in ... Hash tables are efficient imperative maps. How efficient can a purely functional map be? We'll develop
