ONCAMPUS 
Given a BST, find all sequences of nodes starting from root that will essentially give the same binary search tree.
Given a bst, say

  3
 /  \
1    5
the answer should be 3,1,5 and 3,5,1.

another example

       5
     /   \
    4     7
   /     / \
  1     6   10
the outputs will be

5,4,1,7,6,10

5,4,7,6,10,1

5,7,6,10,4,1

etc
Are you able to solve this problem????
If Yes Then,post your Solution.
You can find this problem on stackoverflow.