Here is the binary search tree after inserting the elements in the given order:
The Binary Tree
50
/ \
26 72
/ \ / \
12 28 51 96
/ \ / \
11 16 94 107
/ \ /
9 25 95
/
2
This tree is constructed based on the order of insertion, following the properties of a binary search tree where smaller elements go to the left subtree and larger elements go to the right subtree.
The binary search tree organizes elements by insertion order: smaller left, larger right. Follows insertion sequence: 50, 26, 72, 12, 28, 51, 96, 11, 16, 94, 107, 9, 25, 95, 2.