5,3,8,10,2,1,9 Draw binary search treeeditRegenerate draftrefreshvolume_up

Sure, here is how you can draw a binary search tree from the given numbers:

Step 1: Start with the first number in the sequence. This will be the root of your tree. So, 5 is the root.

Step 2: The next number is 3. Since 3 is less than 5, it goes to the left of 5.

Step 3: The next number is 8. Since 8 is greater than 5, it goes to the right of 5.

Step 4: The next number is 10. Since 10 is greater than 5 and also greater than 8, it goes to the right of 8.

Step 5: The next number is 2. Since 2 is less than 5 and also less than 3, it goes to the left of 3.

Step 6: The next number is 1. Since 1 is less than all the other numbers, it goes to the left of 2.

Step 7: The last number is 9. Since 9 is greater than 5 and 8 but less than 10, it goes to the left of 10.

So, the binary search tree would look like this:

        5
       / \
      3   8
     /     \
    2       10
   /       /
  1       9