 The algorithm stores intervals for nodes of the tree as opposed to single point-valued estimates.Then, leaf nodes of the tree can be searched until one of the top level nodes has an interval which is clearly "best.