Problem $3$

Suppose that we have numbers between $1$ and $1000$ in a binary search tree, and we want to search for the number $363.$

Examine each of the following sequences and determine whether it constitutes a valid search sequence for BST$.$ Provide a

brief explanation for your determination for each sequence.

a$)2,252,401,398,330,344,397,363.$

b$)925,202,911,240,912,245,363.$

c$)935,278,347,621,299,392,358,363.$