已知二叉树,求二叉树中给定的两个节点的最近公共祖先。
#include<vector>
#include<stdio.h>
struct TreeNode
{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) : val(x), left(NULL), right(NULL){
}
};
class Solution
{
public:
Solution() {
};
~Solution() {
};
TreeNode* lowestCommonAncestor
(TreeNode* root, TreeNode* node_p,TreeNode *node_q)
{
std::vector<TreeNode*> node_p_path;
std::vector<TreeNode*> node_q_path;
std::vector<TreeNode*> path<