Patterns in random binary search trees
✍
Philippe Flajolet; Xavier Gourdon; Conrado Martínez
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 243 KB
In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probabilit