Suppose that the following elements are added in the specified order to an empty binary search tree:

Leia, Boba, Darth, R2D2, Han, Luke, Chewy, Jabba

Write the elements of the tree above in the order they would be seen by a pre-order, in-order, and post-order traversal.

The anwser is: Pre-order: Leia, Boba, Darth, Chewy, Han, Jabba, R2D2, Luke In-order: Boba, Chewy, Darth, Han, Jabba, Leia, Luke, R2D2 Post-order: Chewy, Jabba, Han, Darth, Boba, Luke, R2D2, Leia

Can someone explan how does this work? Step by step.