StackOverflow Questions for Tag: least-common-ancestor

Sidhartha Mohapatra

Reputation: 41

lowest common ancestor (LCA) of two given nodes; getting null for one set of values; getting correct answer for another set

pythonbinary-treebinary-search-treeleast-common-ancestor

Score: 0

Answers: 1

user14955967

Reputation:

How does "if right and left: return root" and the "return right or left" help us find the least common ancestor?

binary-treeleast-common-ancestor

Score: 0

Answers: 1

Andro Star

Reputation: 11

Getting Wrong ancestor for the right side of the tree

pythontreebinarybinary-treeleast-common-ancestor

Score: 1

Answers: 0

Abhishek Jaiswal

Reputation: 308

How to define LCA(Least Common Ancestor)(of two nodes) in case of a graph?

algorithmgraphdirected-acyclic-graphsleast-common-ancestor

Score: 1

Answers: 1

Yuval Levy

Reputation: 2516

Least common ancestor search in binary tree non recursive version - Java

javanon-recursiveleast-common-ancestor

Score: 1

Answers: 1

Siddhant

Reputation: 2525

How to find the lowest common ancestor of two nodes in any binary tree?

algorithmbinary-treecomplexity-theoryleast-common-ancestor

Score: 189

Answers: 34

yper

Reputation: 41

Least common ancestor of multiple nodes in DAG

algorithmgraph-algorithmdirected-acyclic-graphsleast-common-ancestor

Score: 4

Answers: 2

zuccy

Reputation: 29

find most visited node in a graph

graphtreeleast-common-ancestor

Score: 2

Answers: 1

zoran2

Reputation: 1

Is this LCA algorithm ok, used elsewhere?

graph-algorithmleast-common-ancestor

Score: 0

Answers: 0

MACS

Reputation: 173

How do criss-cross merges arise in Git?

gitgit-mergeleast-common-ancestor

Score: 10

Answers: 4

Node.JS

Reputation: 1570

Why is this implicit cast is not possible?

c#typesleast-common-ancestor

Score: 4

Answers: 2

Shane Hsu

Reputation: 8357

Range Minimum Query <O(n), O(1)> approach (from tree to restricted RMQ)

algorithmtreeleast-common-ancestorrmqcartesian-tree

Score: 11

Answers: 1

Glaze

Reputation: 11

Splitting a Directed Acyclic Graph (DAG) into components, then finding root and last child in those components

graphgraph-theorydirected-acyclic-graphsleast-common-ancestor

Score: 1

Answers: 1

Nicolas Holthaus

Reputation: 8273

Determine least common ancestor at compile-time

c++algorithmc++14template-meta-programmingleast-common-ancestor

Score: 20

Answers: 3

ciechowoj

Reputation: 924

Find multiple LCAs in unrooted tree

algorithmtreeleast-common-ancestorlowest-common-ancestor

Score: 6

Answers: 2

Patrick Collins

Reputation: 10574

What's wrong with this least common ancestor algorithm?

pythonalgorithmtreeleast-common-ancestor

Score: 2

Answers: 2

thoughtful me

Reputation: 115

Unclear understanding on Lowest Common Ancestor(LCA) Algorithm

algorithmgraphleast-common-ancestorlowest-common-ancestor

Score: 0

Answers: 0

drop27

Reputation: 143

How to represent a non binary tree and how to do LCA on that tree?

algorithmtreeleast-common-ancestor

Score: 7

Answers: 1

Meitar

Reputation: 145

Finding least Common ancestor in Binary Tree with o(h^2) for a change

graphgraph-theorytheoryleast-common-ancestor

Score: 1

Answers: 1

Adam Atanas

Reputation: 19

Most efficient algorithm to check if leaf c is in the same subtree as leaves a and b

algorithmtreeleast-common-ancestor

Score: 1

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: least-common-ancestor

lowest common ancestor (LCA) of two given nodes; getting null for one set of values; getting correct answer for another set

How does &quot;if right and left: return root&quot; and the &quot;return right or left&quot; help us find the least common ancestor?

Getting Wrong ancestor for the right side of the tree

How to define LCA(Least Common Ancestor)(of two nodes) in case of a graph?

Least common ancestor search in binary tree non recursive version - Java

How to find the lowest common ancestor of two nodes in any binary tree?

Least common ancestor of multiple nodes in DAG

find most visited node in a graph

Is this LCA algorithm ok, used elsewhere?

How do criss-cross merges arise in Git?

Why is this implicit cast is not possible?

Range Minimum Query &lt;O(n), O(1)&gt; approach (from tree to restricted RMQ)

Splitting a Directed Acyclic Graph (DAG) into components, then finding root and last child in those components

Determine least common ancestor at compile-time

Find multiple LCAs in unrooted tree

What&#39;s wrong with this least common ancestor algorithm?

Unclear understanding on Lowest Common Ancestor(LCA) Algorithm

How to represent a non binary tree and how to do LCA on that tree?

Finding least Common ancestor in Binary Tree with o(h^2) for a change

Most efficient algorithm to check if leaf c is in the same subtree as leaves a and b

How does "if right and left: return root" and the "return right or left" help us find the least common ancestor?

Range Minimum Query <O(n), O(1)> approach (from tree to restricted RMQ)

What's wrong with this least common ancestor algorithm?