Build a Binary Search Tree $($BST$)$ by inserting the following integers in the order provided.

$9,0,6,2,5,3,1,4,8,7$

What is the output of a level$-$order traversal of your tree? Order the items such that the top item is the first node to be visited, and the bottom item is the last node to be visited.

Note: Order the items such that the first node to be visited is on top, and the last node to be visited is on the bottom.

Drag from here:

Construct your solution here:

$1$

$2$

$3$

$4$

$5$

$6$

$7$

$8$