The digits of normal numbers show very specific behavior in the limit. In many settings, the Birkhoff Ergodic Theorem implies that such numbers are ubiquitous, yet they are very difficult to find. In this talk, we’ll focus on Lüroth expansions. We’ll present a method for constructing Lüroth normal numbers x by concatenating all finite Lüroth expansions using a binary rooted tree, the Lüroth Tree, and prove that x is Lüroth normal in the classical sense. (If there’s time, we can also generalize the Lüroth Tree to prove the normality of a similar construction in a context of Generalized Lüroth Series.)