Login / Signup
Approximation for the Path Complexity of Binary Search Tree.
Nishant Doshi
Published in:
CoRR (2014)
Keyphrases
</>
binary search trees
approximation error
data structure
shortest path
approximation methods
error tolerance
training data
error bounds
search tree
increase in computational complexity
neural network
data analysis
lower bound
special case
worst case