Find the number where the path of two numbers in a binary tree overlap

Question

#include

using namespace std;
int binTree(int n, int m){
    if(n == m)
        return m;
    else if(n < m)
        return binTree(n, m/2);