Left and right length of paths in binary trees or on a question of Knuth

We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$. Under the random tree model, i.e., the Catalan model, we char...

Полное описание

Библиографические подробности

Главный автор:	Alois Panholzer
Формат:	Artigo
Язык:	Inglês
Опубликовано:	Discrete Mathematics & Theoretical Computer Science 2006-01-01
Серии:	Discrete Mathematics & Theoretical Computer Science
Предметы:	binary trees imbalance node depth [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
Online-ссылка:	https://dmtcs.episciences.org/3495/pdf
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!