Binary Trees and Sum of Two Squares

In this paper, we introduce a matrix-based binary tree that forms the foundation of both the Stern–Brocot and Calkin–Wilf trees. We then explore its connection to continued fractions. Building on this relationship, we provide a path-based representation of Brillhart’s proof of the sum of two squares.