Show the final tree only after inserting
10, 20, 30, 25, 35, 40, 11, 28, 65, 60, 54, 75, 47, 14, 15, 16, 17
into a binary search tree.
show step by step of the change of a queue used to do breadth-first print of the tree.
now insert 18 into the tree and then use dsw algorithm to show step by step of right rotations that creates the backbone tree and step by step of making the tree balanced.