Consider the definition of a binary tree: "a binary tree is either empty, or is a root with a left tree and a right tree". This we can write as
T = 1 + T²
Solving the analogous equation z = 1 + z² in the complex numbers gives z to be a primitive sixth-root of unity (https://www.wolframalpha.com/input?i2d=true&i=z+%3D+1+%2B+Po...), i.e. z⁶ = 1, and so z⁷ = z. It turns out that we can similarly show T⁷ = T with some algebra (without subtractions) by repeatedly applying the transformations T→1+T² or 1+T²→T (a "game" version is at http://lebarde.alwaysdata.net/seventrees/): T⁷
= T⁶ + T⁸
= T⁵ + T⁷ + T⁸
= T⁴ + T⁶ + T⁷ + T⁸
= T⁴ + 2T⁷
= T³ + T⁵ + 2T⁷
= T³ + T⁶ + T⁷
= T² + T⁴ + T⁶ + T⁷
= T² + T⁵ + T⁷
= T² + T⁶
= T + T³ + T⁶
= T + T² + T⁴ + T⁶
= T + T² + T⁵
= 2T + T³ + T⁵
= 2T + T⁴
= 1 + T + T² + T⁴
= 1 + T + T³
= 1 + T²
= T
This can be used to give an explicit bijection: see Andreas Blass's paper "Seven trees in one": https://arxiv.org/pdf/math/9405205 (via https://twitter.com/CihanPostsThms/status/157901771352705024... — see also https://math.ucr.edu/home/baez/week202.html which has more.)