The lowest common ancestor (LCA) of any two nodes p and q in a tree, or a directed acyclic graph, is the lowest/deepest node that is the ancestor of p and q (i.e. p and q are the descendents of this node). p and q are both ancestors/descendents of themselves.
-
Notifications
You must be signed in to change notification settings - Fork 0
hamza-mughees/Lowest-Common-Ancestor-Kotlin
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of the solution to the Lowest Common Ancestor problem with Kotlin
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published