Selects the pivot that will split L1 and L3 into approximately equal total areas.
Complexity: O(n log n) average, O(n^2) worst case, where n is the number of nodes in the tree.
Compute the pivot index