1 // x00000004

2 3

4 5 6 7

8 9 10 11

You are given a tree.
It has following properties:
a) its a full binary tree
b) elements in tree follow arithmetic progression if traversed in BFS
c) value at the root node is always 1.

Search for node in the tree. Approach should be better than O(N)