Binary Search Trees - General Questions

An AVL tree keeps the height difference of each node's subtrees at most:

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

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

The keys 10, 45, 20, 80, 35, 65, 25 are inserted in this order into an empty binary search tree. What is its postorder traversal?

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