求二叉树中两个节点的最低公共祖先节点

直接贴代码 

#include "stdafx.h"
#include 
#include 
using namespace std;

//定义二叉树的节点
struct BinaryTreeNode
{
   char m_nvalue;
   BinaryTreeNode * m_pleft;
   BinaryTreeNode * m_pright;
};

//创建值为value的节点
BinaryTreeNode * CreateBinaryTreeNode(char value)
{
	BinaryTreeNode * p=new BinaryTreeNode();
	p->m_nvalue=value;
	p->m_pleft=NULL;
	p->m_pright=NULL;
	return p; 
}

//设置左孩子
void SetLeftchild(BinaryTreeNode * pRoot,BinaryTreeNode * lchild)
{
    if(pRoot==NULL)
		return;
    pRoot->m_pleft=lchild;
}

//设置右孩子
void SetRightchild(BinaryTreeNode * pRoot,BinaryTreeNode * rchild)
{
	if(pRoot==NULL)
		return;
	pRoot->m_pright=rchild;
}

//保存从根到某节点的路径(最重要函数)
bool getPath(BinaryTreeNode * pRoot,BinaryTreeNode * pNode,list & List)
{
	if(pRoot==NULL || pNode ==NULL)
		return false;
    if(pRoot==pNode)
	{
	 List.push_back(pRoot);
	 return true;
	}
	List.push_back(pRoot);
	bool result=getPath(pRoot->m_pleft,pNode,List);
	if(!result)
        result=getPath(pRoot->m_pright,pNode,List);
    if(!result)
       List.pop_back();
	return result;
}

BinaryTreeNode * getCommonParent(BinaryTreeNode * pRoot,BinaryTreeNode * pNode1,BinaryTreeNode * pNode2)
{
  list List1;
  list List2;
  bool result1=getPath(pRoot,pNode1,List1);
  bool result2=getPath(pRoot,pNode2,List2);
  if(result1==false || result2==false)
    return NULL;
  BinaryTreeNode * commonParent=NULL;
  list::iterator ite1=List1.begin();
  list::iterator ite2=List2.begin();
  for(;ite1!=List1.end() && ite2!=List2.end();ite1++,ite2++)
  {
     if(*ite1==*ite2)
      commonParent=*ite1;
	 else
		 break;
  }
  return commonParent;
}

void printList(list &List)
{
	for(list::iterator ite=List.begin();ite!=List.end();ite++)
	{
	   cout<<(*ite)->m_nvalue<<" ";
	}
	cout<m_nvalue<