Lowest common ancestor, C++ (gcc)

Language: Layout:

#include <iostream>
#include <list>
#include <vector>
using namespace std;

struct BinTree {
  
    int data;
    BinTree *left;
    BinTree *right;
    
    BinTree(int d, BinTree* l, BinTree* r): data(d), left(l), right(r) {}
    
};

BinTree* LowestCommonAncestor(BinTree* root, int a, int b) {
 
    if (!root)
        return NULL;
    
    
    if (a == root->data || b == root->data)
        return root;
    
    
    BinTree* lhcLeft = LowestCommonAncestor(root->left, a, b);
    BinTree* lhcRight = LowestCommonAncestor(root->right, a, b);
    
    
    if (lhcLeft && lhcRight)
        return root;
    
    if (lhcLeft)
        return lhcLeft;
    if (lhcRight)
        return lhcRight;
    
    return NULL;
    
}

//           4
//         /   \
//        2     8   
//       / \   / \   
//      1  3  6   9
//           / \
//          5   7

int main()
{
    BinTree *h = new BinTree(7, NULL, NULL);
    BinTree *j = new BinTree(5, NULL, NULL);
    BinTree *g = new BinTree(9, NULL, NULL);
    BinTree *f = new BinTree(6, j, h);
    BinTree *e = new BinTree(3, NULL, NULL);
    BinTree *d = new BinTree(1, NULL, NULL);
    BinTree *c = new BinTree(8, f, g);
    BinTree *b = new BinTree(2, d, e);
    BinTree *a = new BinTree(4, b, c);
    
    cout << LowestCommonAncestor(a, 1, 3)->data;
    
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.35 sec, absolute running time: 0.04 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.4 sec