Draw the binary search tree that results from inserting the following keys into an empty Binary Search Tree $($BST$).$

$41,37,42,43,13,7,24,2,77,71,82,68$

Notes:

You should provide a valid BST$.$

Make sure edges connect from one node to another. Check this by moving the destination node around to see that it's incoming link is connected to the parent node...

Answer: $($penalty regime: $0,20,40,$dots$\%)$

Help Clear

$\backslash$table$[[,$Test,Expected,Got,$],[,\backslash$table$[[$# correct number of nodes in tree?$],[$print$($answer$\_$tree.node$\_$count$()==],[$student$\_$tree.node$\_$count $())]],$True,True,$$