求二叉树中2个节点的最近祖先

思路：

分别记录root到两个节点的路径。

路径知道了，从root开始，不一样的分支点上级就是最近祖先。

 

路径的查找方法有二：

深度优先遍历

并查集（不懂）

 

介绍DFS先，关注传入的参数

path为root到节点的路径。DFS方法如果查找成功返回查找的长度;

否则返回-1。

#include <stack> using namespace std; typedef struct Node { int value; Node *left; Node *right; }Node, *Tree; //首次调用DFS(root, 0, search, path); //其中path数组的长度可以声明为树的高度+1 //深度优先遍历 int DFS(Tree root, int level, int search, int *path) { if(root == NULL) return -1; path[level] = root; if(root.value == search) return level + 1; int ret = DFS(root->left, level+1, search, path); if( ret != -1) { return ret;//查找成功 } else { ret = DFS(root->right, level+1, search, path);//左子树查找不成功的话，查找右子树 return ret; } } Tree getAncestor(Tree root, int search1, int search2) { if(root == NULL) return NULL; int high = getTreeHigh(root); int *path1 = new int[high + 1]; int *path2 = new int[high + 1]; int len1 = DFS(root, 0, search1, path1); if(len1 == -1) return NULL; //查找不到路径 int len2 = DFS(root, 0, search2, path2); if(len2 == -1) return NULL; int i,j; i = j = 0; Tree ret = root; while(i<len1 && j<len2 && path1[i] == path2[j]) { ret = path1[i]; i++; j++; } return ret; }

 

 

改正2：

typedef struct Visit { Tree tree; int isVisit; } Visit; stack<Visit> searchPath(Tree root, int value)//search root-->value path { stack<Visit> s; if(root == NULL) return s; Visit _root; _root.tree = root; _root.isVisit = 0; s.push(_root); while(!s.empty()) //DFS { Visit v = s.top(); if(v.isVisit == 2) { s.pop(); continue; } Tree node = v.tree; if(node->value == value) return s; if(v.isVisit == 0) { v.isVisit++; if(node->left != NULL) { v.isVisit = 1; Visit vv; vv.tree = node->left; vv.isVisit = false; s.push(vv);//先左子树 continue; } } if(v.isVisit == 1) { v.isVisit++; if(node->right != NULL) { Visit vv; vv.tree = node->right; vv.isVisit = false; s.push(vv); } } } return s; } Tree getAncestor(Tree root, int a, int b) { stack<Tree> pathA = searchPath(root, a); stack<Tree> pathB = searchPath(root, b); stack<Tree> sA, sB; while(!pathA.empty()) { sA.push(pathA.top()); pahtA.pop(); } while(!pathB.empty()) { sA.push(pathB.top()); pahtB.pop(); } Tree ret = root; while(!sA.empty() && !sB.empty() && sA.top() == sB.top()) { ret = sA.top(); sA.pop(); sB.pop(); } return ret; }