An extremely simple derivation of the formula for the expected number of nodes on level l in a random digital search tree, built from n random data was studied. Some concepts of basic hypergeometric series were used. The basic hypergeometric series has many significant applications in several areas of pure and applied mathematics including the theory of partitions, combinatorial identities, number theory and statistics.
|Number of pages||7|
|Journal||Applied Mathematics and Computation|
|Publication status||Published - Jan 30 2004|
- Hypergeometric series very well poised
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics