For the set of {\(1, 4, 5, 10, 16, 17, 21\) } of keys, draw binary search trees of heights 2, 3, 4, 5 and 6.
Height of 2:
Height of 3:
Height of 4:
Height of 5:
Height of 6:
The following blocks of LaTeX code were used to generate the above binary search trees:
Height of 2:
Height of 3:
Height of 4:
Height of 5:
Height of 6: