Path length between two nodes in a full binary tree

binary_tree_path.cpp

#include <iostream>
using namespace std;

int path_length(int p, int q) {
    int len = 0;
    //Until p and q reach their lowest common ancestor.
    while (p != q ) {
        if( p > q ) {
            p = p/2;
            len++;
        }
        else if( q > p ) {
            q = q/2;
            len++;
        }
    }
    return len;
}

int main() {
	int t;
	cin >> t;
	while(t--) {
	    int i,j;
	    cin >> i >> j;
	    cout << path_length(i, j) << endl;
	}
	return 0;
}