Binary Search Trees - General Questions

The keys 25, 55, 30, 50, 60, 40, 70 are inserted in this order into an empty binary search tree. What is the height of the tree (number of levels)?

The keys 15, 70, 30, 65, 55, 25, 10 are inserted in this order into an empty binary search tree. What is its postorder traversal?

The keys 30, 20, 75, 25, 40, 35, 80 are inserted in this order into an empty binary search tree. What is its preorder traversal?

The keys 40, 55, 80, 30, 75, 35, 15 are inserted in this order into an empty binary search tree. What is its inorder traversal?

The keys 30, 70, 80, 45, 20, 15, 60 are inserted in this order into an empty binary search tree. What is its preorder traversal?