234 search results - page 6 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
SIGCSE
1996
ACM
15 years 1 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
DAGM
2005
Springer
15 years 3 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
108
click to vote
CIAC
1994
Springer
15 years 1 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...