Inorder binary non-sorted tree traversal

Question

Does inorder tree traversal on a binary integer non-sorted tree produce a sorted array of integers?

I know that if it's a true binary search tree, the result is a sorted array.

For example, would this produce a sorted array:

6
 1
  3
4   5
 22