A binary fractal tree is defined recursively by binary branching. Typically, it consists of a trunk of length `1`

, which splits into two branches of decreasing or equal length, each of which makes an angle Q with the direction of the trunk. Furthermore, both of these branches are divided into two branches, each making an angle Q with the direction of its parent branch, and so on. Continuing in this way, we can infinitely make branches, and the collective diagram is called a **fractal tree**. The following diagram visually shows what such a fractal tree might look like:

Now, let's move on to the code and take a look at how ...

Start Free Trial

No credit card required