给定一棵用二叉链表表示的二叉树，给定其中的结点 x 和 y，编写算法, 显示 x 和 y 结点的所有共祖先结点的值。

基本思路：分别找到结点x的所有祖先结点和y的所有祖先结点，分别存在不同的数组中，最后比较俩个数组，选择相同的输出，就是公共的祖先；

#include <iostream>
using namespace std;
# define maxSize 10
//树结点的结构体，存储的是int整型的数据
typedef struct BTNode{
	int data;
	struct BTNode *lchild;
	struct BTNode *rchild;
}BTNode;
/*
	目标遍历的二叉树:
		  1
		/   \
	   2     3
	  / \   / \
	 4   5 6   7	
	          / \
			 8   9
	
*/
void createBTree(BTNode *&p)
{	
	/*
		生成这颗树，这里就是直接按照二叉树的样子来逐一生成
		p做为根结点(root)
	*/
	p = (BTNode*)malloc(sizeof(BTNode));
	p->data = 1;
	BTNode *n2, *n3, *n4, *n5, *n6, *n7, *n8, *n9;//分别对应存储元素2，3，4，5的4个结点
	n2 = (BTNode*)malloc(sizeof(BTNode));
	n3 = (BTNode*)malloc(sizeof(BTNode));
	n4 = (BTNode*)malloc(sizeof(BTNode));
	n5 = (BTNode*)malloc(sizeof(BTNode));
	n6 = (BTNode*)malloc(sizeof(BTNode));
	n7 = (BTNode*)malloc(sizeof(BTNode));
	n8 = (BTNode*)malloc(sizeof(BTNode));
	n9 = (BTNode*)malloc(sizeof(BTNode));
	n2->data = 2;
	n3->data = 3;
	n4->data = 4;
	n5->data = 5;
	n6->data = 6;
	n7->data = 7;
	n8->data = 8;
	n9->data = 9;
	p->lchild = n2;
	p->rchild = n3;
	n2->lchild = n4;
	n2->rchild = n5;
	n3->lchild = n6;
	n3->rchild = n7;
	n7->lchild = n8;
	n7->rchild = n9;
	n4->lchild = n4->rchild = NULL;
	n5->lchild = n5->rchild = NULL;
	n6->lchild = n6->rchild = NULL;
	n8->lchild = n8->rchild = NULL;
	n9->lchild = n9->rchild = NULL;
}

BTNode *findAncestor(BTNode *p, int key, int *r, int *k)
{
	if (p == NULL) return NULL;
	if (p->data == key) return p;	
	BTNode *q1 = findAncestor(p->lchild, key, r, k);
	if (q1 != NULL)
	{
		//cout << p->data << endl;
		r[++(*k)] = p->data;
		return q1;
	}
	BTNode *q2 = findAncestor(p->rchild, key, r, k);
	if (q2 != NULL)
	{
		//cout << p->data << endl;
		r[++(*k)] = p->data;
		return q2;
	}
	return NULL;
}

int main()
{
	BTNode *p;
	createBTree(p);
	
	int r1[10], a = -1, b = -1;
	int *k1 = &a;
	BTNode *q1 = findAncestor(p, 9, r1, k1);	
	cout << "q1的祖先结点如下:" << endl;
	for (int i = 0; i <= *k1; ++i)
	{
		cout << r1[i] << endl;
	}
	
	
	int r2[10];
	int *k2 = &b;
	BTNode *q2 = findAncestor(p, 4, r2, k2);
	cout << "q2的祖先结点如下:" << endl;
	for (int i = 0; i <= *k2; ++i)
	{
		cout << r2[i] << endl;
	}
	
	
	//计算q1和q2的公共祖先，比较俩个数组的相同的元素即可
	cout << "公共祖先有:" << endl;
	for (int i = 0; i <= *k1; ++i)
	{
		for (int j = 0; j <= *k2; ++j)
		{
			if (r2[j] == r1[i])
			{
				cout << r2[j] << endl;
			}
		}
	}
	return 0;
}

输出结果：