title: Find valid sequences in Binary search trees
body: <p>It is assumed that the integers between 1 and 1000 are arranged in a binary search tree, and it is desired to find the number 363. Some of the following sequences, which could not be the sequence of nodes traversed?</p>
  
  <p>a) 2, 252, 401, 398, 330, 344, 397, 363 ;</p>
  
  <p>b) 924, 220, 911, 244, 898, 258, 362, 363 ;</p>
  
  <p>c) 925, 202, 911, 240, 912, 245, 363 ;</p>
  
  <p>d) 2, 399, 387, 219, 266, 382, 381, 278, 363 ;</p>
  
  <p>e) 935, 278, 347, 621, 299, 392, 358, 363.</p>
  
  <p>Is it necessary to make patterns? Write in a minimal form property to check.
  Thanks.</p>