Recursive Trees

Biologist Aristid Lindenmayer, in 1968, developed L-systems, a sets of rules and symbols to model the growth processes of algae (and later more complex plants as well). This system captured the recursive structure of organic forms well. For this problem, we will not be working with general L-systems but instead a specific instance to draw a stylized model of a tree.

Experiment with the code from the textbook to draw a tree using Python's turtle module to create variations like those shown below. Some experiments you may want to try include: not making the tree perfectly symmetrical, drawing a shape, i.e., a "leaf", for the base case, making more than just two branches, using randomness to vary the branching angles, or adding color. To do this, you will most likely need to add multiple parameters to the function than just the length of the trunk.