commit 1c2d0dc44b1240c39828849112f9cb24df36cf6c parent 0ed3cd14313c145652f9f4e9a2800945986f5a3d Author: Antoine Amarilli <a3nm@a3nm.net> Date: Thu, 26 Mar 2026 10:08:27 +0100 commit with codex Diffstat:
| lowest_common_ancestor_problem | | | 3 | ++- |
1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/lowest_common_ancestor_problem b/lowest_common_ancestor_problem @@ -2,6 +2,7 @@ Given two [nodes] in a [tree], find their [LCA] -A [tree] can be [preprocessed] in [linear_time] to support such queries in [constant_time], cf for instance https://en.wikipedia.org/wiki/Tarjan%27s_off-line_lowest_common_ancestors_algorithm +A [tree] can be [preprocessed] in [linear_time] to support such queries in [constant_time] +- cf https://en.wikipedia.org/wiki/Tarjan%27s_off-line_lowest_common_ancestors_algorithm Up: [computational_problem], [lowest_common_ancestor]