Lowest Common Ancestor in BST

[ybkim]

namespace BST {
    template<typename T>
    struct Node {
        T      data;
        Node * left;
        Node * right;

        explicit Node (
            const T & data
        )   : data(data)
            , left(nullptr)
            , right(nullptr)
        {}
    }

    template<typename T>
    Node<T> * LowestCommonAncestor (
        Node<T> * root,
        Node<T> * p,
        Node<T> * q
    ) {
        /* Enter your code here */

        return nullptr;
    }
};