Binary Search Trees - General Questions

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

The keys 75, 55, 20, 60, 10, 50, 15 are inserted in this order into an empty binary search tree. What is its postorder traversal?

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 65, 70, 25, 45, 15, 35, 40 are inserted in this order into an empty binary search tree. What is the height of the tree (number of levels)?