Distant parents in complete binary trees

zbMATH Open1288.05044arXiv1405.5624MaRDI QIDQ5401243FDOQ5401243

Authors: S. P. Glasby 

Publication date: 12 March 2014

Abstract: There is a unique path from the root of a tree to any other vertex. Every vertex, except the root, has a parent: the adjoining vertex on this unique path. This is the conventional definition of the parent vertex. For complete binary trees, however, we show that it is useful to define another parent vertex, called a emph{distant parent}. The study of distant parents leads to novel connections with dyadic rational numbers. Moreover, we apply the concepts of close and distant parent vertices to deduce an apparently new sense in which continued fractions are `best' rational approximations.

Full work available at URL: https://arxiv.org/abs/1405.5624

Recommendations

• Probabilities Related to Father-Son Distances in Binary Search Trees
• Geodesic continued fractions
• A forest of linear fractional transformations
• Two trees enumerating the positive rationals
• \(k\)-protected vertices in binary search trees

zbMATH Keywords

continued fractionstringchildrenparentinfinite complete binary treeinorder

Mathematics Subject Classification ID

Trees (05C05) Continued fractions (11A55)

Cited In (1)

• On the Stern-Brocot expansion of real numbers

This page was built for publication: Distant parents in complete binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401243)