Abstract
Search trees, specially binary search trees, are very important data structures thatcontributed immensely to improved performance of different search algorithms. In this paper, we express certain parameters of search trees in terms of Stirling numbers. We also introduce two new inversion formulas relating Stirling numbers of the first and second kinds.
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.
