LowestCommonAncestor.cpp

# Single node definition
struct Node {
    int value;
    Node *left;
    Node *right;
};

class Solution {
public:
    Node* LowestCommonAncestor(Node* root, Node* p, Node* q){
        if(root){
            if(root -> value == p -> value || root -> value == q -> value){
                return root;
            } else {
                auto left = LowestCommonAncestor(root, p, q);
                auto right = LowestCommonAncestor(root, p, q);
                
                if( left && right ){
                    return root;
                }
                if( left ){
                    return left;
                }
                if( right ) {
                    return right;
                }
                return nullptr;
            }
        } else {
            return nullptr;
        }
    }   
};