Is there a binary search tree $($BST$)$ T and a query value X such that the search for X in T visits the following sequence of key values in the given order?

a$)100,40,70,101,141$

b$)141,101,70,40$

c$)1,100,50,60$

d$)10,30,20,40$