|The binary tree poem is an experimental verse form developed by Jason A. Banico, and it borrows elements from mathematics and computer science. It is an eleven-line verse form in which each line is split into two parts that are repeated elsewhere in the poem. Three stanzas of three lines each conclude with a two-line coda. The poem takes this form: line 1: A | B; line 2: C | A; line 3: B | D; line 4: A | C; line 5: E | A; line 6: C | F; line 7: B | D; line 8: G | B; line 9: D | H; line 10: E | F; line 11: G | H. In computer science, a binary tree is a tree data structure in which each node has at most two children.
The binary tree dissects a line; the line then spawns two more.
The binary tree dissects a line; it grows and ramifies.
The line then spawns two more. It bifurcates above and below.
One day it will bear fruit. Roots nourish tree, and branches bear fruit.
The day was cold and rather dreary; I sat at home alone and weary.
The day was cold and rather dreary; a raven tapped at my chamber door.
I sat at home alone and weary; my thoughts were focused on dear Lenore.
The raven croaked a word: "Nevermore." My thoughts returned to my poor Lenore.