Suffix Tree Linear Time Construction

Suffix Tree Linear Time Construction: a task in Terminal-Lego-15k (Harbor dataset). This task explores the construction of suffix trees in linear time. A naive analysis suggests that building a suffix tree requires O(n²) time because there are n suffixes with lengths n, n-1, n-2, ..., 1. However…