Lowest Common Ancestor of a Binary Tree

一、题目内容：Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.


According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”


        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6      _2       0       8
         /  \
         7   4

For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

二、代码实现

 TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        stack<TreeNode*> st;
	   TreeNode* tmp=root;
        while(1)
		{
			if(traverseTree(tmp->left,p))
			{
				st.push(tmp);
				tmp=tmp->left;
			}
			else if(traverseTree(tmp->right,p))
			{
				st.push(tmp);
				tmp=tmp->right;
			}
			else
			{
				st.push(tmp);
				break;			
			}
		}
		//
		while(!st.empty())
		{
			tmp=st.top();
			st.pop();
			if(traverseTree(tmp,q))
				return tmp;			
		}
    }
    bool traverseTree(TreeNode* root,TreeNode* p)
 {
	 if(root==NULL)
		 return false;
	 if(root==p)
		 return true;
	 if(traverseTree(root->left,p))
		 return true;
		 
	 return traverseTree(root->right,p);
 }

三、执行效果

  虽然AC了，但是相对于其他方法，还是比较慢，想办法优化中。