Binary Search Trees - General Questions

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

The keys 55, 75, 45, 10, 80, 30, 70 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?

Which self-balancing tree is used by many standard libraries' ordered maps?

The keys 40, 10, 15, 20, 45, 70, 75 are inserted in this order into an empty binary search tree. What is the height of the tree (number of levels)?