Algorithm——LCA(Least Common Ancestors)

Правка en3, от A1p36th, 2020-04-16 13:10:09

1.introduction

As everyone knows, my friend Billy2007 is not good at The algorithm of tree, So I and he write this blog.

LCA , that is, the recent Common ancestor, refers to the root tree, find out one or two nodes u and v recent Common ancestor.

Теги lca, #algorithms

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en14 Английский A1p36th 2020-04-17 08:42:35 0 (published)
en13 Английский A1p36th 2020-04-17 08:41:41 2
en12 Английский A1p36th 2020-04-17 08:41:23 34
en11 Английский A1p36th 2020-04-17 08:40:35 12
en10 Английский A1p36th 2020-04-17 08:39:51 471
en9 Английский A1p36th 2020-04-16 16:55:36 131
en8 Английский A1p36th 2020-04-16 13:28:52 325
en7 Английский A1p36th 2020-04-16 13:25:09 177
en6 Английский A1p36th 2020-04-16 13:20:49 55
en5 Английский A1p36th 2020-04-16 13:16:42 4 Tiny change: 'integers, N,M,SN,M,SN,M,S which res' -> 'integers, $N,M,S$ which res'
en4 Английский A1p36th 2020-04-16 13:14:05 659
en3 Английский A1p36th 2020-04-16 13:10:09 2 Tiny change: 'oduction\nAs ever' -> 'oduction\n\nAs ever'
en2 Английский A1p36th 2020-04-16 13:09:43 213
en1 Английский A1p36th 2020-04-16 13:06:26 98 Initial revision (saved to drafts)