The blog mentions it at the very end but the linked text “The Algorithmic Beauty of Plants” is a great read. L-systems, the technique used to generate these trees are a surprisingly easy way of generating various fractal-like patterns, and are a very fun thing to play with. It’s not that often that a relatively dense bit of CS can be used to make such pretty pictures.

The branch splitting technique here is how I always used to doodle pictures of trees in the margins of my notes when I was listening to lectures at uni. (Also at school and work but not so much there as I'd often get scolded for doing so - which is why I never remembered any of that stuff but did remember uni lectures... sigh)

This idea was one of the things that really solidified my early learning of programming.

I made a lot of games using Scratch back in the day and I recall someone creating a tutorial on how to use recursion to draw trees. Whoever that was taught me a lot.

Similar demo:

http://davmlaw.github.io/ProceduralGraphics/fall.html