Binary Search Trees - General Questions

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

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?

In a binary search tree, for every node:

Deleting a node with two children from a BST replaces it with its:

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?