 Fractional cascading has been applied elsewhere, such as in data mining and Internet Protocol routing.Binary search has been generalized to work on certain types of graphs, where the target value is stored in a vertex instead of an array element.Binary search trees are one such generalization—when a vertex (node) in the tree is queried, the algorithm either learns that the vertex is the target, or otherwise which subtree the target would be located in.