Lowest common ancestor ( $u \land v$ )

The lowest common ancestor of two vertices is the common ancestor farthest from the root. In the ancestor partial order with the root least, it is their infimum, also called their greatest common ancestor.

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Lowest common ancestor by

Wikipedia Bot  1

 View more

The lowest common ancestor (LCA) of two nodes in a tree is defined as the deepest node that is an ancestor of both nodes. In a more formal sense, if you have two nodes $ p $ and $ q $ in a tree, the LCA is the node $ x $ such that: 1. $ x $ is an ancestor of both $ p $ and $ q $.

 Read the full article

  See all articles in the same topic Create my own version

Lowest common ancestor ( $u \land v$ )

 Ancestors (6)

 Incoming links (3)

 Synonyms (1)

 Discussion (0)

 Articles by others on the same topic (1)

Lowest common ancestor (u∧v)

 Ancestors (6)

 Incoming links (3)

 Synonyms (1)

 Discussion (0)  Subscribe (1)

 Articles by others on the same topic (1)

Lowest common ancestor ( $u \land v$ )

 Discussion (0)