On the Subtree Size Profile of Binary Search trees

DOI10.1017/S0963548309990630zbMath1198.05135MaRDI QIDQ4933600

Florian Dennert, Rudolf Grübel

Publication date: 14 October 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

random treestree sequencebinary search tree algorithm

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (5)

Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Limit Theorems for Subtree Size Profiles of Increasing Trees ⋮ Normal limiting distribution of the size of binary interval trees ⋮ Search trees: metric aspects and strong limit theorems ⋮ Distinct fringe subtrees in random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• A general limit theorem for recursive algorithms and combinatorial structures
• The profile of binary search trees
• A functional limit theorem for the profile of search trees
• Limit laws for local counters in random binary search trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees

This page was built for publication: On the Subtree Size Profile of Binary Search trees