To draw the binary search tree with the elements inserted in the order you provided (50, 72, 96, 94, 107, 26, 12, 11, 9, 2, 10, 25, 51, 16, 17, 95), follow these steps:
1. Start with the first element (50) as the root of the tree.
2. For each subsequent element, compare it to the current node:
- If the element is less than the current node, move to the left child.
- If the element is greater than the current node, move to the right child.
3. If the child node is empty, insert the element as a new node in that position.
4. Repeat steps 2-3 for all the remaining elements.
The resulting binary search tree will look like this:
```
50
/ \
26 72
/ \ / \
12 25 51 96
/ \ / \
11 16 94 107
/ / \ \
9 10 17 95
\
2
```