least-common-ancestor

I am searching a non recursive algorithm version of finding the least common ancestor in a sorted binary tree written in Java. Everything I found is only the recursive version (even on stackoverflow and on other websites). Can some one write or direct me to the non recursive version (using while loop)? Also write if this version is more efficient in terms of time complexity? Just happened to see this long forgotten question. Do you mean something like, if you are given a tree: A B C D E F G H I J K L M N O commonAncestor(L,G) = C commonAncestor(H,O) = A commonAncestor(B,H) = B something like

Following is my algorithm to find first common ancestor. But I don’t know how to calculate it time complexity, can anyone help? public Tree commonAncestor(Tree root, Tree p, Tree q) { if (covers(root.left, p) && covers(root.left, q)) return commonAncestor(root.left, p, q); if (covers(root.right, p) && covers(root.right, q)) return commonAncestor(root.right, p, q); return root; } private boolean covers(Tree root, Tree p) { /* is p a child of root? */ if (root == null) return false; if (root == p) return true; return covers(root.left, p) || covers(root.right, p); } Ok, so let's start by

Goal : I am looking for an algorithm to find the best common ancestor of a graph where nodes in the graph can have zero, one, or two parents. I am not sure of the terminology of "best common ancestor": better terminology might be "lowest common ancestor", or "recent common ancestor", etc. If there is better terminology then please provide URL's that describe such. The algorithm has access to the full graph data structure. It is possible for a given node to have zero, one, or two parents. This is key because the algorithms I've seen on the web assume that a given node has either zero or one

How are non binary trees typically represented? Trees where there is no limit to the number of children a node can have. Is it best to use a Adjacency Matrix or Adjacency List and just assume there will be no cycles, or do something similar to this question -> How to implement a Non-Binary tree and follow up question, when you have a n-ary tree (is that the correct name for them?) What's a good way to find the Least Common Ancestor for two given nodes/data values in that tree? All I can find are algorithms that deal with binary trees, like this one -> static Node lca(Node root,int v1,int v2) {