Would the in-order traversal of the following elements in a binary tree look like this?

The elements are inserted in the following order : 50,45,12,15,60,55,70,65,80.

Following the left-root-right pattern: 70,60,80,45,15,50,55,12,65

Im not sure I got it right from the tree I just drew, would appreciate any help