Remark 2.5 The theory of (random) decision trees played a key role in computer science (we refer the reader to the survey [1]}), but also found many applications in other fields of mathematics. In particular, random decision trees (sometimes called randomized algorithms) were used in [2]} to study the noise sensitivity of Boolean functions, for instance in the context of percolation theory. It was also used in [3]} in combination with the OSSS inequality (which was originally introduced in [4]}) to prove sharpness of random-cluster models.

