Publisher review:Range minima and least common ancestors implements data structures for solving Range minimization and Least common ancestors problems. This script implements data structures for solving the following two problems:
- Range minimization: given an array X of data, quickly find min(X[i:j]) for different ranges i:j.
- Least common ancestors: given a tree, quickly find the lowest tree node that is an ancestor of all of a given set of nodes.
Range minima and least common ancestors is a Python script for Programming Methods and Algorithms scripts design by David Eppstein.
It runs on following operating system: Windows / Linux / Mac OS / BSD / Solaris.
Operating system:Windows / Linux / Mac OS / BSD / Solaris