I am trying to learn about binary search trees and I am not getting far. I am looking at this example. can anyone give some insight?
The following names are inserted in the order given, into an initially empty binary search tree.
Which names will be in the leaves of the completed leaves?
Which names will be in nodes with exactly one child?
Which names insertion will force the first rotation?
Which name will be the lowest unbalanced node at the time of the first rotation?