Abstract
The purpose of this paper is to settle two conjectures by Flajolet, Gourdon and Martinez (1996). We confirm that in a random binary tree on n nodes, the expected number of different subtrees grows indeed as Θ ( n log n ) . Secondly, if K is the largest integer such that all possible shapes of subtrees of cardinality less than or equal to K occur in a random binary search tree, then we show that K ~ log n log log n in probability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
