Suppose that we have numbers between $1$ and $1000$ in a binary search tree and want to search for the number $363$. Which of the following sequences could not be the sequences of nodes examined
a) 924,220,911,244,898,258,362,363$ b) 925,202,911,240,912,245,363 c) 2,399,387,219,266,382,381,278,363 d) 935,278,347,621,299,392,358,363 e) 925, 202, 911, 240, 912, 245, 363
I know that $d$ and $e$ are not valid sequences, my professor told us so. I know it has something to do the range between jumping from node to node, which has something to do with the following property of BST's
Let $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \leq x.key$. If $y$ is a node in the right subtree of $x$, then $y.key \geq x.key$.
I just don't see it, been trying to simulate the path sequence with no clear breakthrough.