how to write out 4 respective insertion sequences into an empty binary search tree?

Question

Thanks a million!!!

Answer 1

it's depends on the kinds of binary search tree

but i think is go to insert the first number at the head and second you will be make if statement , if bigger go to right , if small go left ... and so on

Answer 2

Your first insertion will be the root node.
now check if the next node is greater or less than the previous number. Depending on this you will insert the number into left child or right child. You have to carry this procedure.