A note on limits of sequences of binary trees

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the set of possible limits and its structure as a...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 25:1; no. Analysis of Algorithms; pp. 1 - 15
Main Author:	Grübel, Rudolf
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2023 Discrete Mathematics & Theoretical Computer Science
Subjects:	05c05, 60c05, 68w40 mathematics - combinatorics mathematics - probability Metric space Normality Permutations Search algorithms Set theory Sorting algorithms Topology Trees (mathematics)
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!