方法一
#include <iostream>
#include <vector>
using namespace std;
struct Node
{
int val;
Node* left;
Node* right;
Node(int v)
{
val = v;
left = nullptr;
right = nullptr;
}
};
void GetNodePath(Node* root, Node* node, vector<Node*>& v, bool& flag)
//用后根遍历的方式寻找node,找到后存储从该节点到根节点的路径
{
if (root == NULL || flag == true)//根为空或者node已经找到了
return;
GetNodePath(root->left, node, v, flag);
GetNodePath(root->right, node, v, flag);
if (root->val == node->val || flag == true)//找到node或者root为node到根节点路径上的节点
{
v.push_back(root);//存储从node到根节点的路径
flag = true;
}
}
Node* CreatTree()//初始化树
{
Node* root = new Node(1);
Node* node1 = new Node(2);
Node* node2 = new Node(3);
Node* node3 = new Node(4);
Node* node4 = new Node(5);
Node* node5 = new Node(6);
Node* node6 = new Node(7);
root->left = node1;
root->right = node2;
node1->left = node3;
node1->right = node4;
node2->left = node5;
node2->right = node6;
return root;
}
int main()
{
Node* root = CreatTree();
Node* node1 = new Node(5);
Node* node2 = new Node(6);
bool flag = false;
vector<Node*> path1;//用于记录路径
vector<Node*> path2;
GetNodePath(root, node1, path1, flag);
flag = false;
GetNodePath(root, node2, path2, flag);
//下面代码用于求两个链表的第一个公共节点
int i = 0, j = 0;
if (path1.size() > path2.size())
i = path1.size() - path2.size();
else
j = path2.size() - path1.size();
int res = -1;
while (i < path1.size() && j < path2.size())
{
if (path1[i]->val == path2[j]->val)
{
res = path1[i]->val;
break;
}
i++;
j++;
}
cout << res << endl;
cout << i + j;
cout << endl;
system("pause");
return 0;
}
方法二
#include <iostream>
#include <vector>
using namespace std;
struct Node
{
int val;
Node* left;
Node* right;
Node(int v)
{
val = v;
left = nullptr;
right = nullptr;
}
};
Node* CreatTree()//初始化树
{
Node* root = new Node(1);
Node* node1 = new Node(2);
Node* node2 = new Node(3);
Node* node3 = new Node(4);
Node* node4 = new Node(5);
Node* node5 = new Node(6);
Node* node6 = new Node(7);
root->left = node1;
root->right = node2;
node1->left = node3;
node1->right = node4;
node2->left = node5;
node2->right = node6;
return root;
}
Node* FindFather(Node* root, Node* node1, Node* node2, int& flag)
{
if (flag == 2)//如果两个节点都已经被找到,那么接着递归下去就没有了意义
return nullptr;
if (root == nullptr)
return nullptr;
Node* left = FindFather(root->left, node1, node2, flag);//采用类似后根遍历的方式
Node* right = FindFather(root->right, node1, node2, flag);
if (left && right)//若两个节点分别在root的左右子树被发现,说明root就是最低祖先节点
return root;
if (root->val == node1->val)//发现第一个节点
{
flag++;
return root;
}
if (root->val == node2->val)//发现第二个节点
{
flag++;
return root;
}
if (left == nullptr && right)//右子树发现节点,左子树未发现
return right;
if (right == nullptr && left)//左子树发现节点,右子树未发现
return left;
return nullptr;//左右子树均未发现node1、node2
}
int FindPath(Node* root, Node* node, int &flag)
//从最低公共祖先出发寻找到达node的路径长度
{
if (flag == 1)//已经找到了,后面的递归没必要进行下去了
return -1;
if (root == nullptr || node == nullptr)
return -1;
if (root->val == node->val)
{
flag = 1;
return 0;
}
int left = FindPath(root->left, node, flag);
int right = FindPath(root->right, node, flag);
if (left >= 0)
return left + 1;
else if (right >= 0)
return right + 1;
else
return -1;//未找到返回-1
}
int main()
{
Node* root = CreatTree();
Node* node1 = new Node(6);
Node* node2 = new Node(5);
int flag = 0;
Node* father = FindFather(root, node1, node2, flag);
int flag1 = 0, flag2 = 0;
cout << FindPath(father, node1, flag1) + FindPath(father, node2, flag2) << endl;
system("pause");
return 0;
}