non-recursive

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

I am writing an Add function to add nodes to a binary tree non recursively. I have run into the problem of only being able to produce one level deep binary tree. I debugged it and I know where the problem is but can't figure out how to fix it. Maybe fresh pair of eyes will see something i dont... The problem is that my temp node is being reset to the root value every new function call and hence, adding nodes linearly. Anyways, here is the function: void BinaryTreeNonRec::add(int num){ treeNode *temp, *parent; if (root==NULL) { root = new treeNode; root->data=num; root->left=0; root->right=0;

Can anyone point out a way of getting the depth of a Node in a Binary Tree (not a balanced one, or BST) without using recursion ? Ideally in Java/C/C# The node is represented as: class Node { Node Left; Node Right; string Value; int Depth; } Using Level Order with a FIFO list was my first thought, but I was stumped at detecting when the level changes, particular for unbalanced trees. I assume you mean filling in the Depth value on node, and/or finding max depth. One way to do this would be using two lists, and doing the level order as suggested. It'd be akin to: int level=0; List<Node>

I am able to understand preorder traversal without using recursion, but I'm having a hard time with inorder traversal. I just don't seem to get it, perhaps, because I haven't understood the inner working of recursion. This is what I've tried so far: def traverseInorder(node): lifo = Lifo() lifo.push(node) while True: if node is None: break if node.left is not None: lifo.push(node.left) node = node.left continue prev = node while True: if node is None: break print node.value prev = node node = lifo.pop() node = prev if node.right is not None: lifo.push(node.right) node = node.right else: break

I'm working on a small drawing application in Java. I'm trying to create a 'bucket-fill' tool by implementing the Flood Fill algorithm. I tried using a recursion implementation, but it was problematic. Anyway, I searched around the web and it seems that for this purpose, a non-recursive implementation of this algorithm is recommended. So I ask you: Could you describe a non-recursive implementation of the Flood Fill algorithm ? An actual code example, some pseudo-code, or even a general explanation will all be welcome. I'm looking for simplest, or the most efficient implementation you can think