Binary Search Trees - General Questions

The keys 25, 45, 40, 55, 10, 65, 70 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 10, 45, 55, 75, 50, 70, 20 are inserted in this order into an empty binary search tree. What is its postorder traversal?

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

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?