B. Binary-tree-array:

Just convert the string into binary notation. ie:L to 0 and R to 1. let that value be b in decimal. then the answer will be 2^n+b.

proof:

code okay here...
int main(){
}

fhf