you have a binary tree whose left skew, right skew and level orders are sorted.

Also element at nth level of right skew is <element at the n+1 level of left skew

Now given a number, you have to tell if the number is present in the tree or not

Can anyone answer for this?