Does This Prove $P \neq NP$? (Randomly Populated Binary Tree)
No, it doesn't. Your input size is exponential in terms of n. So the proper way to look at it would be to define k=2n-1 and solve the problems in terms of k.