Lowest Common Ancestor of a Binary Tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Given the following binary tree:  root = [3,5,1,6,2,0,8,null,null,7,4]

        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6      _2       0       8
         /  \
         7   4
Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3
Explanation: The LCA of of nodes 5 and 1 is 3.
Example 2:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
Output: 5
Explanation: The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself
             according to the LCA definition.

对于p,q两个元素，如果是最小公共祖先，有两种情况：1. 当前节点是p或者q， 2. 一个节点在当前节点的左边，一个节点在当前节点的右边。满足这两个条件就可以了之一，这个节点就是最小公共祖先了。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        bool findp=false, findq=false;

        while(findp == findq)
        {
            if(root == p || root == q)return root;
            findp = findq = false;
            findEle(root->left, p, findp);
            findEle(root->left, q, findq);

            if(findp == findq && findp == true)
            {
                root= root->left;
            }
            if(findp == findq && findp == false)
            {

                root = root->right;

            }
        }
        return root;

    }

    void findEle(TreeNode* root, TreeNode* p, bool& isfind)
    {
        if(root == NULL)return;
        if(root == p)
        {
            isfind = true;
            return;
        }
        findEle(root->left, p, isfind);
        findEle(root->right, p, isfind);
    }
};