Title of article
Search trees and Stirling numbers
Author/Authors
A.H. Manob، نويسنده , , T.M. Islam، نويسنده , , M.T. Parvez، نويسنده , , M. Kaykobad، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
8
From page
747
To page
754
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.
Keywords
Search trees , Generating functions , Stirling numbers
Journal title
Computers and Mathematics with Applications
Serial Year
2004
Journal title
Computers and Mathematics with Applications
Record number
920093
Link To Document