Identifying the sorted traversal pattern

The sorted traversal technique can solve some specific types of binary search tree problems. These are generally easy problems where we need to process every node using the functionf in the sorted order (ascending) of values of the nodes. We may also need to aggregate all the processed values over a function g in the same order. In cases where the same copy of some data must be shared between all nodes, those variables are created in the calling function or the enclosing scope.

If the problem statement or its solution follows the generic template below, it can be solved by applying the sorted traversal technique.