Binary Tree Poem

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 I 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

The binary tree dissects a line; the line then spawns two more.
It grows and ramifies. The binary tree dissects a line.
The line then spawns two more; it bifurcates above and below.

The binary tree dissects a line; it grows and ramifies.
One day it will bear fruit. The binary tree dissects a line;
It grows and ramifies. Roots nourish tree, and branches bear fruit.

The line then spawns two more. It bifurcates above and below.
The roots provide a stable anchor. The line then spawns two more.
It bifurcates above and below. The canopy gives shade.

One day it will bear fruit. Roots nourish tree, and branches bear fruit.
The roots provide a stable anchor; the canopy gives shade.

[ back to poetry page ]