Abstract
In this paper, we show that there is a natural correspondence between a tree's edge-search strategy and its node-search strategy. By doing so, we simplify the previous linear time algorithm for determining the edge-search number of a tree, and improve the running time of a previous algorithm for constructing an edge-search strategy (or plan) for a tree containing n vertices from O(n log n) to O(n) time.