Gopal and binary tree

In an infinitely long complete binary tree Gopal travels according to his plan. At the start of the journey he is standing at the root. He has designed a string which directs his journey. The string is like this : l -> go left child r -> go right child u -> go up His Journey ends in certain level.He wants to know the sum of value of nodes in that level. The tree is numbered like this. root