234 search results - page 7 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
SIAMCOMP
1998
14 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
103
click to vote
DAGSTUHL
2007
14 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...