(Tkinter: H-tree fractal) An H-tree is a fractal defined as

Authors:

Y Daniel Lang

Chapter:

5.recursion

Exercise:

Programming Excercises

Question:29 | ISBN:978013274719 | Edition: 6

Question

(Tkinter: H-tree fractal) An H-tree is a fractal defined as follows:
1. Begin with a letter H. The three lines of the H are of the same length, as shown in Figure 15.1a.
2. The letter H (in its sans-serif form, H) has four endpoints. Draw an H centered at each of the four endpoints to an H-tree of order 1, as shown in Figure 15.1b. These Hs are half the size of the H that contains the four endpoints.
3. Repeat Step 2 to create an H-tree of order 2, 3, ..., and so on, as shown in Figure 15.1c–d.
Write a Python program that draws an H-tree, as shown in Figure 15.1.