a$)$ Add elements with the specified keys $($in the given order$)$ to a binary search tree that is initially empty: $30,40,25,56,45,26,11,13.$

Illustrate the resulting tree.

b$)$ What is the result of performing a preorder traversal?