code: function findLineage (getValue, isAncestor, value, tree, path) {
      path = path || [];
  
      if (tree && isAncestor(value, tree)) {
        path.push(tree);
  
        var // The child is only correct if the children matches the value
          childIndex = binaryIndexBy(getValue, value, tree.children), // exactly,
          foundChild = tree.children[childIndex], // otherwise the index is where
          child = foundChild && getValue(foundChild) === value // it would be
            ? foundChild : tree.children[childIndex - 1]; // (i.e. One too high)
  
        return findLineage(getValue, isAncestor, value, child, path);
      }
  
      return path;
    }
docs: ************************************************************************* Private Standard Data Structures Algorithms ************************************************************************* Produces a path down the tree to a leaf of the ancestors of the topic