Finding an optimal tree searching strategy in linear time

@inproceedings{Mozes2008FindingAO,
  title={Finding an optimal tree searching strategy in linear time},
  author={Shay Mozes and Krzysztof Onak and Oren Weimann},
  booktitle={SODA},
  year={2008}
}
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the goal is to minimize the number of queries required to find a target element in the worst case. However, while the optimal strategy for searching an array is straightforward (always query the middle element), the optimal strategy for searching a tree is dependent on the tree's structure and is harder to compute. We… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…