On the subtree size profile of binary search trees

DOI10.1017/S0963548309990630zbMATH Open1198.05135MaRDI QIDQ4933600FDOQ4933600

Authors: Florian Dennert, Rudolf Grübel 

Publication date: 14 October 2010

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

Recommendations

• On the subtrees of random binary search trees
• Random binary trees. Algorithms, asymptotics and statistics
• The profile of binary search trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• On the richness of the collection of subtrees in random binary search trees

zbMATH Keywords

random treestree sequencebinary search tree algorithm

Mathematics Subject Classification ID

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

Cites Work

• A general limit theorem for recursive algorithms and combinatorial structures
• The profile of binary search trees
• Title not available (Why is that?)
• Limit laws for local counters in random binary search trees
• Title not available (Why is that?)
• A functional limit theorem for the profile of search trees
• Profiles of random trees: Limit theorems for random recursive trees and 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

Cited In (13)

• Random binary trees. Algorithms, asymptotics and statistics
• Title not available (Why is that?)
• On the richness of the collection of subtrees in random binary search trees
• The profile of binary search trees
• Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
• Martingales and profile of binary search trees
• Binary search trees of permuton samples
• Normal limiting distribution of the size of binary interval trees
• The subtree size profile of bucket recursive trees
• On the subtrees of random binary search trees
• Distinct fringe subtrees in random trees
• Limit theorems for subtree size profiles of increasing trees
• Search trees: metric aspects and strong limit theorems

This page was built for publication: On the subtree size profile of binary search trees

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