Backtracking Search

When operating on arbitrary arity trees, it is useful to be able to search the entire structure for specific data. In the binary search algorithm, we ensured items were sorted and then moved down the tree in search of a particular answer. There are situations, however, where we might need to move up the tree in order to find what we need.