Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 450627, 8 pages
http://dx.doi.org/10.1155/2013/450627
Research Article

The -Version of Binary Search Trees: An Average Case Analysis

Department of Mathematics, Stellenbosch University, Stellenbosch, Matieland 7602, South Africa

Received 6 August 2012; Accepted 25 August 2012

Academic Editors: R. Dondi, A. P. Godbole, and S. Richter

Copyright © 2013 Helmut Prodinger. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Following a suggestion of Cichoń and Macyna, binary search trees are generalized by keeping (classical) binary search trees and distributing incoming data at random to the individual trees. Costs for unsuccessful and successful search are analyzed, as well as the internal path length.